• 대한수학회논문집
• /
• 제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.

• 대한수학회논문집
• /
• 제32권3호
• /
• pp.601-617
• /
• 2017

We give a function associated with generalized Ostrowski type inequality and its integral representation for local fractional calculus. Then, using this function and its integral representation, we establish several inequalities of generalized Ostrowski type for twice local fractional differentiable functions. We also consider some special cases of the main results which are further applied to a concrete function to yield two interesting inequalities associated with two generalized means.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.685-689
• /
• 2005

In this paper, we consider a robust output feedback model predictive controller(MPC) design for Wiener model. Nonlinearities that couldn't be represented in static nonlinearity block of Wiener model are regarded as uncertainties in linear block. An dynamic output feedback controller design method is presented for Wiener MPC. According to MPC algorithm, the control law is computed based on linear matrix inequality(LMI)at each sampling time by solving convex optimization. Also, a new parameter dependent Lyapunov function is proposed to get a less conservative condition. The results are illustrated with numerical example.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.62.4-62
• /
• 2001

In this paper, we propose a delay-dependent guaranteed cost controller design method for uncertain linear systems with time delay. The uncertainty is norm bounded and time-varying. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, sufficient condition, which guarantees that the closed-loop system is asymptotically stable and the upper bound value of the closed-loop cost function is not more than a specied one, is derived in terms of Linear Matrix Inequalities(LMIs) that can be solved sufficiently. A convex optimization problem can be formulated to design a guaranteed cost controller, which minimizes the upper bound value of the cost function. Numerical examples show the activeness of the proposed method.

• Journal of applied mathematics & informatics
• /
• 제30권5_6호
• /
• pp.759-772
• /
• 2012

In this paper, semi-infinite constrained programming, a class of constrained nonsmooth optimization problems, are transformed into unconstrained nonsmooth convex programs under the help of exact penalty function. The unconstrained objective function which owns the primal-dual gradient structure has connection with $\mathcal{VU}$-space decomposition. Then a $\mathcal{VU}$-space decomposition method can be applied for solving this unconstrained programs. Finally, the superlinear convergence algorithm is proved under certain assumption.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1987년도 정기총회 및 창립40주년기념 학술대회 학회본부
• /
• pp.425-429
• /
• 1987

This paper describes a collision avoidance method for planning safe trajectories for multi-robot system in common work space. Usually objects have been approximated to convex polyhedra in most previous researches, but in case using such the approximation method it is difficult to represent objects analytically in terms of functions and also to describe tile relationship between the objects. In this paper, in order to solve such problems a modeling method which approximates objects to cylinder ended by hemispheres and or sphere is used and the maximum distance functions is defined which call be calculated simply. Using an objective function with inequality constraints which are related to minimum distance functions, work range and maximum allowable angular velocities of the robots, tile collision avoidance for two robots is formulated to a constrained function optimization problem. With a view to solve tile problem a penalty function having simple form is defined and used. A simple numerical example involving two PUMA-type robots is described.

• East Asian mathematical journal
• /
• 제32권1호
• /
• pp.47-59
• /
• 2016

The purpose of the present paper is to introduce and investigate two new subclasses of bi-univalent functions of complex order defined in the open unit disk, which are associated with Hurwitz-Lerch zeta function and satisfying subordinate conditions. Furthermore, we find estimates on the Taylor-Maclaurin coefficients ${\mid}a_2{\mid}$ and ${\mid}a_3{\mid}$ for functions in the new subclasses. Several (known or new) consequences of the results are also pointed out.

• Kyungpook Mathematical Journal
• /
• 제45권3호
• /
• pp.395-404
• /
• 2005

Let α be a complex number with 𝕽α > 0. Let the functions f and g be analytic in the unit disc E = {z : |z| < 1} and normalized by the conditions f(0) = g(0) = 0, f'(0) = g'(0) = 1. In the present article, we study the differential subordinations of the forms $${\alpha}{\frac{z^2f^{{\prime}{\prime}}(z)}{f(z)}}+{\frac{zf^{\prime}(z)}{f(z)}}{\prec}{\alpha}{\frac{z^2g^{{\prime}{\prime}}(z)}{g(z)}}+{\frac{zg^{\prime}(z)}{g(z)}},\;z{\in}E,$$ and $${\frac{z^2f^{{\prime}{\prime}}(z)}{f(z)}}{\prec}{\frac{z^2g^{{\prime}{\prime}}(z)}{g(z)}},\;z{\in}E.$$ As consequences, we obtain a number of sufficient conditions for star likeness of analytic maps in the unit disc. Here, the symbol ' ${\prec}$ ' stands for subordination

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제25권3호
• /
• pp.107-116
• /
• 2021

We introduce optimization algorithms using Bregman Divergence for solving non-negative matrix factorization (NMF) problems. Bregman divergence is known a generalization of some divergences such as Frobenius norm and KL divergence and etc. Some algorithms can be applicable to not only NMF with Frobenius norm but also NMF with more general Bregman divergence. Matrix Factorization is a popular non-convex optimization problem, for which alternating minimization schemes are mostly used. We develop the Bregman proximal gradient method applicable for all NMF formulated in any Bregman divergences. In the derivation of NMF algorithm for Bregman divergence, we need to use majorization/minimization(MM) for a proper auxiliary function. We present algorithmic aspects of NMF for Bregman divergence by using MM of auxiliary function.

• 대한수학회보
• /
• 제35권3호
• /
• pp.533-545
• /
• 1998

In this paper, we prove the existence of solutions of the heat equation for harmonic map on a compact manifold with a boundary when the target manifold is allowed to have positively curved parts.