• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.12
• /
• pp.655-660
• /
• 2004

This paper deals with the design of a fixed-structure $H_\infty$ power system stabilizer (PSS) by using an iterative linear matrix inequality (LMI) method. The fixed-structure $H_\infty$ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, a linear penalty function is incorporated into the objective function so that minimizing the penalized objective function subject to LMIs amounts to a convex optimization problem. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. The proposed algorithm is, therefore, convergent. Numerical experiments show the practical applicability of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.325-331
• /
• 2007

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation $B_{k+1}s_k=y^*_k,\;where\;y^*_k$ is the sum of $y_k\;and\;A_ks_k,\;and\;A_k$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

• Communications of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.789-797
• /
• 2020

By considering a certain univalent function in the open unit disk 𝕌, that maps 𝕌 onto a strip domain, we introduce a new class of analytic and close-to-convex functions by means of a certain non-homogeneous Cauchy-Euler-type differential equation. We determine the coefficient bounds for functions in this new class. Relevant connections of some of the results obtained with those in earlier works are also provided.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.20-21
• /
• 2018

행렬의 rank 최소화 기법은 영상 잡음 제거, 행렬 완성(completion), low rank 행렬 복원 등 다양한 영상처리 분야에서 효과적으로 이용되어 왔다. 특히 nuclear norm 을 이용한 low rank 최소화 기법은 convex optimization 을 통하여 대상 행렬의 특이값(singular value)을 thresholding 함으로써 간단하게 low rank 행렬을 얻을 수 있다. 하지만, nuclear norm 을 이용한 low rank 최소화 방법은 행렬의 rank 값을 정확하게 근사하지 못하기 때문에 잡음 제거가 효과적으로 이루어지지 못한다. 본 논문에서는 영상의 잡음을 제거 하기 위해 다중 잡음 제거 영상을 이용하여 유사도가 높은 유사 패치 행렬을 구성하고, 유사 패치 행렬의 rank 를 non-convex function 을 이용하여 최소화시키는 방법을 통해 잡음을 제거하는 방법을 제안한다.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.2
• /
• pp.82-89
• /
• 1985

A new non-inferior solution is obtained by investigating method of weight p- norm to explain the conception of MCO (multiple criterion optimization) problem. And then the optimum non-inferior solution is obtained by the weight minimization method applied to objective function of MOSFET NAND rATEAlso this weight minimization method using weight P- norm methods can be applied to non-convex objective function. The result of this minimization method shows the efficiency in comparison with that of Lightner.

• International Journal of Aeronautical and Space Sciences
• /
• v.14 no.3
• /
• pp.256-263
• /
• 2013

The saturation of the actuator impairs the response performance of the near space interceptor control system. A control system based on the properties of linear tracking system is designed for this problem. The properties are that the maximum value of the pseudo-Lyapunov function of the linear tracking control system do not present at the initial state but at the steady state, based on which the bounded stability problem is converted into linear tracking problem. The pseudo-Lyapunov function of the linear tracking system contain the input variables; the amplitude and frequency of the input variables affect the stability of the nonlinear control system. Designate expected closed-loop poles area for different input commands and obtain a controller which is function of input variables. The coupling between variables and linear matrices make the control system design problem non-convex. The non-convex problem is converted into a convex LMI according to the Shur complement lemma and iterative algorithm. Finally the simulation shows that the designed optimal control system is quick and accurate; the rationality of the presented design techniques is validated.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.6
• /
• pp.257-266
• /
• 2015

There is no polynomial-time algorithm that can be obtain the optimal solution for economic load dispatch problem with non-convex fuel cost functions. Therefore, electrical field uses quadratic fuel cost function unavoidably. This paper proposes a valve-point optimization (VPO) algorithm for economic load dispatch problem with non-convex fuel cost functions. This algorithm sets the initial values to maximum powers $P_i{\leftarrow}P_i^{max}$ for each generator. It then reduces the generation power of generator i with an average power cost of $_{max}\bar{c}_i$ to a valve point power $P_{ik}$. The proposed algorithm has been found to perform better than the extant heuristic methods when applied to 13 and 40-generator benchmark data. This paper consequently proves that the optimal solution to economic load dispatch problem with non-convex fuel cost functions converges to the valve-point power of each generator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1402-1413
• /
• 2004

In non-rigid image registration, the Jacobian determinant of the estimated deformation should be positive everywhere since physical deformations are always invertible. We propose a constrained optimization technique at ensures the positiveness of Jacobian determinant for cubic B-spline based deformation. We derived sufficient conditions for positive Jacobian determinant by bounding the differences of consecutive coefficients. The parameter set that satisfies the conditions is convex; it is the intersection of simple half spaces. We solve the optimization problem using a gradient projection method with Dykstra's cyclic projection algorithm. Analytical results, simulations and experimental results with inhale/exhale CT images with comparison to other methods are presented.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2405-2407
• /
• 2001

In this paper, we apply and evolutionary computation(EC), probabilistic optimization algorithm, to active contour. A number of problems exist associated with such as algorithm initialization, existence of local minima, non-convex search space, and the selection of model parameters in conventional models. We propose an adequate fitness function for these problems. The determination of fitness function adequate to active contour using EC is important in search capability. As a result of applying the proposed method to non-convex object shape, we improve the unstability and contraction phenomena, in nature, of snake generated in deformable contour optimization.

• Communications of the Korean Mathematical Society
• /
• v.34 no.4
• /
• pp.1279-1287
• /
• 2019

The main purpose of the paper is to prove that if a compact Riemannian manifold admits a gradient ${\rho}$-Einstein soliton such that the gradient Einstein potential is a non-trivial conformal vector field, then the manifold is isometric to the Euclidean sphere. We have showed that a Riemannian manifold satisfying gradient ${\rho}$-Einstein soliton with convex Einstein potential possesses non-negative scalar curvature. We have also deduced a sufficient condition for a Riemannian manifold to be compact which satisfies almost ${\eta}$-Ricci soliton.