A new exact penalty function method for continuous inequality constrained optimization problems
Open Access
- 1 January 2010
- journal article
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 6 (4) , 895-910
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
This publication has 22 references indexed in Scilit:
- A smoothing approach for semi-infinite programming with projected Newton-type algorithmJournal of Industrial and Management Optimization, 2009
- A Smoothing Newton Method for Semi-Infinite ProgrammingJournal of Global Optimization, 2004
- A New Exact Penalty FunctionSIAM Journal on Optimization, 2003
- An Adaptive Dual Parametrization Algorithm for Quadratic Semi-infinite Programming ProblemsJournal of Global Optimization, 2002
- Semi-Infinite Programming Approach to Continuously-Constrained Linear-Quadratic Optimal Control ProblemsJournal of Optimization Theory and Applications, 2001
- A Dual Parametrization Method for Convex Semi-Infinite ProgrammingAnnals of Operations Research, 2000
- Semi-Infinite Programming: Theory, Methods, and ApplicationsSIAM Review, 1993
- A computational algorithm for functional inequality constrained optimization problemsAutomatica, 1990
- A survey of optimization techniques for integrated-circuit designProceedings of the IEEE, 1981
- An improved algorithm for optimization problems with functional inequality constraintsIEEE Transactions on Automatic Control, 1980