IMA Journal of Numerical Analysis Advance Access originally published online on March 14, 2008
IMA Journal of Numerical Analysis 2008 28(4):749-769; doi:10.1093/imanum/drn003
| ||||||||||||||||||||||||||||||||||||||||||||||||||
Flexible penalty functions for nonlinear constrained optimization

Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL 60208-3118, USA
Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL 60208-3118, USA
Email: fecurt{at}gmail.com
Received on 11 April 2007. Accepted for publication 5 January 2008.
| Abstract |
|---|
We propose a globalization strategy for nonlinear constrained optimization. The method employs a flexible penalty function to promote convergence, where during each iteration the penalty parameter can be chosen as any number within a prescribed interval, rather than a fixed value. This increased flexibility in the step acceptance procedure is designed to promote long productive steps for fast convergence. An analysis of the global convergence properties of the approach in the context of a line search sequential quadratic programming method and numerical results for the KNITRO software package are presented.
Key Words: nonlinear programming; constrained optimization; sequential quadratic programming; penalty functions; global convergence
Dedicated to Prof. M. J. D. Powell, pioneer of nonlinear optimization, on occasion of his 70th birthday.