• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.8
• /
• pp.1334-1341
• /
• 2008

This paper introduces an approach of Hybrid Particle Swarm Optimization(HPSO) for a security-constrained economic dispatch(SCED) with line flow constraints. To reduce a early convergence effect of PSO algorithm, we proposed HPSO algorithm considering a mutation characteristic of Genetic Algorithm(GA). In power system, for considering N-1 line contingency, we have chosen critical line contingency through a process of Screening and Selection based on PI(performance Index). To prove the ability of the proposed HPSO in solving nonlinear optimization problems, SCED problems with nonconvex solution spaces are considered and solved with three different approach(Conventional GA, PSO, HPSO). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• v.18 no.1_2
• /
• pp.1-23
• /
• 2005

The decentralized static output feedback design problem is considered. A constrained trust region method is developed that solves this optimal control problem when a complete set of state variables is not available. The considered problem is interpreted as a non-linear (non-convex) constrained matrix optimization problem. Then, a decentralized constrained trust region method is developed for this problem class exploiting the diagonal structure of the problem and using inexact computations. Finally, numerical results are given for the proposed method.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.15 no.2
• /
• pp.544-556
• /
• 1991

The optimization of many engineering design problems requires a nonlinear programming algorithm that is robust and efficient. A general-purpose nonlinear optimization program IDOL (Interactive Design Optimization Library) is developed based on the Augmented Lagrange Mulitiplier (ALM) method. The ideas of selecting a good initial design point, using resonable initial values for Lagrange multipliers, constraints scaling, descent vector restarting, and dynamic stopping criterion are employed for computational enhancement to the ALM method. A descent vector is determined by using the Broydon-Fletcher-Goldfarb-Shanno (BFGS) method. For line search, the Incremental-Search method is first used to find bounds on the solution, then the bounds are reduced by the Golden Section method, and finally a cubic polynomial approximation technique is applied to locate the next design point. Seven typical test problems are solved to show IDOL efficient and robust.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.490-495
• /
• 1992

A neural model predictive control strategy combining a neural network for plant identification and a nonlinear programming algorithm for solving nonlinear control problems is proposed. A constrained nonlinear optimization approach using successive quadratic programming cooperates with neural identification network is used to generate the optimum control law for the complicate continuous/batch chemical reactor systems that have inherent nonlinear dynamics. Based on our approach, we developed a neural model predictive controller(NMPC) which shows excellent performances on nonlinear, model-plant mismatch cases of chemical reactor systems.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.2
• /
• pp.127-138
• /
• 1999

For reverse engineering, curves and surfaces are modeled for new products by interpolating the digitized data points. But there are many measuring or deviation errors. Therefore, it is important to handle errors during the curve or surface modeling. If the errors are ignored, designer could get undesirable results. For this reason, fairing procedure with the aesthetics criteria is necessary in computer modeling. This paper presents methods of 3D NURBS curve fairing. The techniques are based on automatic repositioning of the digitized dat points or the NURBS curve control points by a constrained nonlinear optimization algorithm. The objective function is derived variously by derived curved. Constraints are distance measures between the original and the modified digitized data points. Changes I curve shape are analyzed by illustrations of curve shapes, and continuous plotting of curvature and torsion.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.173-190
• /
• 2011

In this paper, we construct a new approach of affine scaling interior algorithm using the affine scaling conjugate gradient and Lanczos methods for bound constrained nonlinear optimization. We get the iterative direction by solving quadratic model via affine scaling conjugate gradient and Lanczos methods. By using the line search backtracking technique, we will find an acceptable trial step length along this direction which makes the iterate point strictly feasible and the objective function nonmonotonically decreasing. Global convergence and local superlinear convergence rate of the proposed algorithm are established under some reasonable conditions. Finally, we present some numerical results to illustrate the effectiveness of the proposed algorithm.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.22 no.3_1spc
• /
• pp.558-565
• /
• 2013

This paper describes a whole-body (human body's) motion generation scheme for an android robot that uses motion capture device and a nonlinear constrained optimization method. Because the captured motion data are based on global coordinates and the actors have different heights and different upper-lower body ratios, the captured motion data cannot be used directly for a humanoid robot. In this paper, we suggest a method for obtaining robot joint angles, which allow the resultant robot motion to be as close as possible to the captured human motion data, by applying a nonlinear constrained optimization method. In addition, the results are animated to demonstrate the similarity of the motions.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.6
• /
• pp.128-136
• /
• 1995

The problem addressed in this paper is that of the on-line computational burden of time-optimal control laws for quick, strongly nonlinear systems like revolute robots. It will be demonstrated that a large amount of off-line computation can be substituted for most of the on-line burden in cases of time optimization with constrained inputs if differential point-to- point specifications can be relaxed to cell-to-cell transitions. These cells result from a coarse discretization of likely swaths of state space into a set of nonuniform, contiguous volumes of relatively simple shapes. The cell boundaries approximate stream surfaces of the phase fluid and surfaces of equal transit times. Once the cells have been designed, the bang- bang schedules for the inputs are determined for all likely starting cells and terminating cells. The scheduling process is completed by treating all cells into which the trajectories might unex- pectedly stray as additional starting cells. Then an efficient-to-compute control law can be based on the resulting table of optimal strategies.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.899-902
• /
• 1993

A neural model predictive control strategy combining a neural network for plant identification and a nonlinear programming algorithm for solving nonlinear control problems is proposed. A constrained nonlinear optimization approach using successive quadratic programming combined with neural identification network is used to generate the optimum control law for complex continuous chemical reactor systems that have inherent nonlinear dynamics. The neural model predictive controller (MNPC) shows good performances and robustness. To whom all correspondence should be addressed.

• Communications of the Korean Mathematical Society
• /
• v.11 no.4
• /
• pp.1147-1157
• /
• 1996

Nonlinear ill-posed problems arise in many application including parameter estimation and inverse scattering. We introduce a least squares regularization method to solve nonlinear ill-posed problems with constraints robustly and efficiently. The regularization method uses Trust-Region approach to handle the constraints on variables. The Generalized Cross Validation is used to choose the regularization parameter in computational tests. Numerical results are given to exhibit faster convergence of the method over other methods.