A new exact penalty function method for continuous inequality
constrained optimization problems
Changjun Yu - Department of Mathematics and Statistics, Curtin University of Technology, Kent Street, Bentley 6102, WA, Australia (email)
Abstract: In this paper, a computational approach based on a new exact penalty function method is devised for solving a class of continuous inequality constrained optimization problems. The continuous inequality constraints are first approximated by smooth function in integral form. Then, we construct a new exact penalty function, where the summation of all these approximate smooth functions in integral form, called the constraint violation, is appended to the objective function. In this way, we obtain a sequence of approximate unconstrained optimization problems. It is shown that if the value of the penalty parameter is sufficiently large, then any local minimizer of the corresponding unconstrained optimization problem is a local minimizer of the original problem. For illustration, three examples are solved using the proposed method. From the solutions obtained, we observe that the values of their objective functions are amongst the smallest when compared with those obtained by other existing methods available in the literature. More importantly, our method finds solution which satisfies the continuous inequality constraints.
Keywords: Exact Penalty Function, Semi-Infinite Programming, Constrained Optimization.
Received: March 2010; Revised: July 2010; Available Online: September 2010.
2015 Impact Factor.776