• 대한수학회지
• /
• 제54권1호
• /
• pp.267-280
• /
• 2017

In this paper, we study analytic and geometric properties of the solution q(z) to the differential equation q(z) + zq'(z)/q(z) = h(z) with the initial condition q(0) = 1 for a given analytic function h(z) on the unit disk |z| < 1 in the complex plane with h(0) = 1. In particular, we investigate the possible largest constant c > 0 such that the condition |Im [zf"(z)/f'(z)]| < c on |z| < 1 implies starlikeness of an analytic function f(z) on |z| < 1 with f(0) = f'(0) - 1 = 0.

• 대한수학회논문집
• /
• 제11권3호
• /
• pp.665-672
• /
• 1996

Let U denote the set of all Schwarzian derivatives $S_f$ of conformal function f in the unit disk D. We show that if $S_f$ is a local extreme point of U, then f cannot omit an open set. We also show that if $S_f \in U$ is an extreme point of the closed convex hull $\bar{co}U$ of U, then f cannot omit a set of positive area. The proof of this uses Nguyen's theorem.

• International Journal of Control, Automation, and Systems
• /
• 제5권2호
• /
• pp.138-146
• /
• 2007

The analysis and design method for achieving robust stabilization of Decentralized Dynamic Surface Control (DDSC) is presented for a class of interconnected nonlinear systems. While a centralized design approach of DSC was developed in [1], the decentralized approach to deal with large-scale interconnected systems is proposed under the assumption that interconnected functions among subsystems are unknown but bounded. To provide a closed-loop form with provable stability properties, augmented error dynamics for N nonlinear subsystems with DDSC are derived. Then, the reachable set for errors of the closed-loop systems will be approximated numerically in the form of an ellipsoid in the framework of convex optimization. Finally, a numerical algorithm to calculate the $L_2$ gain of the augmented error dynamics is presented.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.149-151
• /
• 2007

For several decades, VSC has gained much attention as one of the useful design tools for handling the practical system with uncertainties or disturbances. Generally, the disturbances in the matching condition can be perfectly rejected via VSC; however, these in the mismatching condition are known to be hardly rejected. There have been some trials on it, in which the resulting controls in fact belong to the class of robust control guaranteeing disturbance ${\gamma}$-attenuation. Therefore, in this paper, we propose a new Variable Structure Control (VSC) for a system with mismatched disturbances. The proposed controller is composed of linear and nonlinear parts; the former plays a role in stabilizing the system and the latter takes care of attenuating the disturbances. The main contribution is to introduce the concept of switching-zone, rather than switching-surface, that is designed through piece-wise Lyapunov functions. The resulting non-convex conditions are formulated with an iterative linear programming algorithm, which provides an excellent performance of almost rejecting the disturbances.

• Journal of applied mathematics & informatics
• /
• 제32권3_4호
• /
• pp.359-375
• /
• 2014

In this paper, a multiobjective nondifferentiable fractional programming problem (MFP) is considered where the objective function contains a term involving the support function of a compact convex set. A vector valued (generalized) ${\alpha}$-univex function is defined to extend the concept of a real valued (generalized) ${\alpha}$-univex function. Using these functions, sufficient optimality criteria are obtained for a feasible solution of (MFP) to be an efficient or weakly efficient solution of (MFP). Duality results are obtained for a Mond-Weir type dual under (generalized) ${\alpha}$-univexity assumptions.

• 대한수학회보
• /
• 제47권1호
• /
• pp.89-102
• /
• 2010

This paper concerns the problem of global robust stability of a time-delay discontinuous system with a positive-defined connection matrix under polytopic-type uncertainty. In order to give the stability condition, we firstly address the existence of solution and equilibrium point based on the properties of M-matrix, Lyapunov-like approach and the theories of differential equations with discontinuous right-hand side as introduced by Filippov. Second, we give the delay-independent and delay-dependent stability condition in terms of linear matrix inequalities (LMIs), and based on Lyapunov function and the properties of the convex sets. One numerical example demonstrate the validity of the proposed criteria.

• 산업경영시스템학회지
• /
• 제30권2호
• /
• pp.83-88
• /
• 2007

본 논문에서 선형함수의 곱의 형태로 표현된 비선형 함수를 목적식 또는 제약식에 가지는 비선형 최적화 문제를 새로운 변수를 추가하여 선형 Relaxation 최적화 문제로 Reformulation 하는 기법을 소개한다. 특히, 선형함수의 곱의 형태를 가지는 비선형 함수를 포함하는 비선형 정수 최적화 문제를 선형 정수 최적화 문제로 Relaxation할 경우 두 최적화 문제의 해가 일치함을 보인다. 또한 소개된 Relaxation 기법을 응용하여, 추가되는 변수의 수를 증가시킴으로서, 보다 Tight한 Relaxation 문제를 도출하는 과정에 대하여 소개한다.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 춘계학술대회 논문집
• /
• pp.141-146
• /
• 1999

A new method, so called MMA(Method of Moving Asymptotes) was applied to the optimization problems of non-linear functions and non-linear structures. In each step of the iterative process, tile MMA generates a strictly convex approximation subproblems and solves them by using the dual problems. The generation of these subproblems is controlled by so called 'moving asymptotes', which may both make no oscillation and speed up tile convergence rate of optimization process. By contrast in generalized dual function, the generated function by MMA is always explicit type. Both the objective and behaviour constraints which were approximated are optimized by dual function. As the results of some examples, it was found that this method is very effective to obtain the global solution for problems with many local solutions. Also it was found that MMA is a very effective approximate method using the original function and its 1st derivatives.

• 전기전자학회논문지
• /
• 제19권4호
• /
• pp.526-534
• /
• 2015

In this paper, we studied the use of the foreground and background features and SVM classifier to improve the accuracy of offline handwritten numeral recognition. The foreground features are two directional features: directional gradient feature by Kirsch operators and directional stroke feature by local shrinking and expanding operations, and the background feature is concavity feature which is extracted from the convex hull of the numeral, where the concavity feature functions as complement to the directional features. During classification of the numeral, these three features are combined to obtain good discrimination power. The efficiency of our scheme is tested by recognition experiments on the handwritten numeral database CENPARMI, where SVM classifier with RBF kernel is used. The experimental results show the usefulness of our scheme and recognition rate of 99.10% is achieved.

• 대한수학회논문집
• /
• 제20권2호
• /
• pp.339-350
• /
• 2005

We obtain the following two inequalities on a strongly pseudoconvex domain $\Omega\;in\;\mathbb{C}^n\;:\;for\;f\;{\in}\;O(\Omega)$ $$\int_{0}^{{\delta}0}t^{a{\mid}a{\mid}+b}M_p^a(t, D^{a}f)dt\lesssim\int_{0}^{{\delta}0}t^{b}M_p^a(t,\;f)dt\;\int_{O}^{{\delta}O}t_{b}M_p^a(t,\;f)dt\lesssim\sum_{j=0}^{m}\int_{O}^{{\delta}O}t^{am+b}M_{p}^{a}\(t,\;\aleph^{i}f\)dt$$. In [9], Shi proved these results for the unit ball in $\mathbb{C}^n$. These are generalizations of some classical results of Hardy and Littlewood.