论文信息 - A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems

A class of continuously differentiable exact penalty function algorithms for nonlinear programming problems

In this paper we describe Newton-type and Quasi-Newton algorithms for the solution of NLP problems with inequality constraints, which are based on the use of a continuously differentiable exact penalty function.

L. Grippo | G. Pillo

[1] R. Fletcher,et al. A Class of Methods for Nonlinear Programming II Computational Experience , 1970 .

[2] M. J. D. Powell,et al. THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONS , 1978 .

[3] Torkel Glad,et al. A multiplier method with automatic limitation of penalty growth , 1979, Math. Program..

[4] L. Grippo,et al. A new augmented Lagrangian function for inequality constraints in nonlinear programming problems , 1982 .

[5] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .