• Journal of applied mathematics & informatics
• /
• v.35 no.1_2
• /
• pp.33-44
• /
• 2017

We review weighted power means of positive real numbers and see their properties including the convexity and concavity for weights. We study the mixed power means of positive real numbers related to majorization of weights, which gives us an extension of Muirhead's inequality. Furthermore, we generalize Holland's conjecture to the power means.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.97-104
• /
• 1989

This paper extends the existence proofs of a Nash equilibrium to a more general class of differentila game models with constraints on the control spaces. With the assumptions of continuity, convexity, and compactness, the existence is proved using Kakutani Theorem and via a path-following approach. Furthermore, the proof for a period-by-period optimization of multi-period problems provides an insight to a numerical solution algorithm to differential game models with constraints.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.523-561
• /
• 2008

The purpose of this paper is to survey the use of the important method of scaling in analysis, and particularly in complex analysis. Applications are given to the study of automorophism groups, to canonical kernels, to holomorphic invariants, and to analysis in infinite dimensions. Current research directions are described and future paths indicated.

• Korean Management Science Review
• /
• v.26 no.1
• /
• pp.1-5
• /
• 2009

I study a solution concept which preserves the nice Nash equilibrium properties of two-person zero-sum games, and define a locally competitive equilibrium which is characterized by a saddle point with respect to the coordinates of strategies. I show that a locally competitive equilibrium shares the properties of uniqueness of equilibrium payoffs, interchangeablity of equilibrium strategies and convexity of the equilibrium set.

• Kyungpook Mathematical Journal
• /
• v.55 no.2
• /
• pp.383-394
• /
• 2015

In this paper, we define two new subclass of k-uniformly starlike and convex functions of order ${\alpha}$ type ${\beta}$ with varying argument of coefficients. Further, we obtain coefficient estimates, extreme points, growth and distortion bounds, radii of starlikeness, convexity and results on modified Hadamard products.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.1
• /
• pp.96-104
• /
• 1990

In this paper, a novel method of jig-saw puzzle matching is proposed using a modifided boundary matching algorithm without a priori knowledge for the matched puzzle. Specifically, a boundary tracking algorithm is utilised to segment each puzzle from low-resolution image data. Segmented puzzle is described via corner point, angle and distance between two adjacent coner point, and convexity and/or concavity of corner point. Proposed algorithm is implemented and tested in IBM PC and PC version vision system, and applied successfully to real jig-saw puzzles.

• Nuclear Engineering and Technology
• /
• v.30 no.4
• /
• pp.353-363
• /
• 1998

The H$_{\infty}$ algorithms of the mixed weight sensitivity is used for the robust design of the reactor power control system. The mixed weight sensitivity method requires the selection of the proper weighting functions for the loop shaping in frequency domain. The complexity of the system equation and the non-convexity of the problem make it very difficult to determine the weighting functions. The genetic algorithm which is improved and hybridized with the simulated annealing is applied to determine the weighting functions. This approach permits an automatic calculation and the resultant system shows good robustness and performance.

• Honam Mathematical Journal
• /
• v.42 no.3
• /
• pp.577-590
• /
• 2020

In this paper, new subclasses of analytic functions are proposed by using Mittag-Leffler function. Also some properties of these classes are studied in regard to coefficient inequality, distortion theorems, extreme points, radii of starlikeness and convexity and obtained numerous sharp results.

• East Asian mathematical journal
• /
• v.27 no.5
• /
• pp.539-543
• /
• 2011

In this paper, we consider an optimization problem which consists a nonconvex quadratic objective function and two nonconvex quadratic constraint functions. We formulate its dual problem with semidefinite constraints, and we establish weak and strong duality theorems which hold between these two problems. And we give an example to illustrate our duality results. It is worth while noticing that our weak and strong duality theorems hold without convexity assumptions.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.08a
• /
• pp.31-36
• /
• 2003

A field reconstruction scheme for a cell centered finite volume method on unstructured meshes is developed. Regardless of mesh quality, this method is exact within a machine accuracy if the solution is linear, which means it has full second order accuracy. It does not have any limitation on cell shape except convexity of the cells and recovers standard discretization stencils at structured orthogonal grids. Accuracy comparisons with other popular reconstruction schemes are performed on a simple example.