Abstract
A first order algorithm for solving the problem of minimizing a function subject to equality constraints is presented. At each iteration the algorithm generates a search direction which has two components, the first component being chosen to satisfy (to first order) the equality constraint and the second to be a descent direction for the objective function. The step length is determined using an exact penalty function. A procedure for choosing a suitable value for the parameter in the exact penalty function completes the algorithm description. Global convergence is established, and a comparison with alternative algorithms is made.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Asaadi, “A computational comparison of some nonlinear programs”,Mathematical Programming 4 (1973) 144–154.
D.P. Bertsekas, “Necessary and sufficient conditions for a penalty method to be exact”,Mathematical Programming 9 (1975) 87–99.
A.R. Colville, “A comparative study on nonlinear programming codes”, IBM New York Scientific Center, Report 320-2949 (Yorktown Heights, NY, 1968).
A.R. Conn, “Constrained optimization using a nondifferentiable penalty function”,SIAM Journal on Numerical Analysis 10 (1973) 760–784.
A.R. Conn and T. Pietrzykowski, “A penalty function method converging directly to a constrained optimum”,SIAM Journal on Numerical Analysis 14 (1977) 348–378.
R. Fletcher, “A class of methods for nonlinear programming with termination and convergence properties”, in: J. Abadie, ed.,Integer and nonlinear programming (North-Holland, Amsterdam, 1970).
R. Fletcher and S.A. Lill, “A class of methods for nonlinear programming, II Computational experience”, in: J.B. Rosen, O.L. Mangasarian and K. Ritter, eds.,Nonlinear programming (Academic Press, New York, 1951).
A.V. Fiacco and G.P. McCormick,Nonlinear programming, sequential unconstrained minimization techniques (Wiley, New York, 1968).
S.P. Han, “A globally convergent method for nonlinear programming”,Journal of Optimization Theory and Applications 22 (1977) 297–309.
S. Howe, “New conditions for exactness of a simple penalty function”,SIAM Journal on Control 11 (1973) 378–381.
D.G. Luenberger, “Control problems with kinks”,IEEE Transactions on Automatic Control AC-15 (1970).
D.Q. Mayne and E. Polak, “Feasible directions algorithms for optimization problems with equality and inequality constraints”,Mathematical Programming 11 (1976) 67–80.
T. Pietrzykowski, “An exact potential method for constrained maxima”,SIAM Journal on Numerical Analysis 6 (1969) 229–303.
E. Polak, “On the global stabilization of locally convergent algorithms”,Automatica 12 (1976) 337–342.
M.J.D. Powell, “A method for nonlinear constraints in minimization problems”, in: R. Fletcher, ed.,Optimization (Academic Press, New York, 1969) pp. 283–298.
M.J.D. Powell, “A fast algorithm for nonlinearly constrained optimization calculations”, 1977Dundee Conference on Numerical Analysis.
H.H. Rosenbrock, “An automatic method for finding the greatest or least value of a function”,Computer Journal 3 (1960) 175.
W.I. Zangwill, “Nonlinear programming via penalty functions”,Management Science 13 (1967) 344–358.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mayne, D.Q., Maratos, N. A first order, exact penalty function algorithm for equality constrained optimization problems. Mathematical Programming 16, 303–324 (1979). https://doi.org/10.1007/BF01582118
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01582118