A second-order method for the general nonlinear programming problem

This paper presents a multiplier-type method for nonlinear programming problems with both equality and inequality constraints. Slack variables are used for the inequalities. The penalty coefficient is adjusted automatically, and the method converges quadratically to points satisfying second-order conditions.

[1]  Magnus R. Hestenes.  The Weierstrass $E$-function in the calculus of variations , 1946 .

[2]  Magnus R. Hestenes,et al.  Sufficient conditions for the isoperimetric problem of Bolza in the calculus of variations , 1946 .

[3]  Boris Polyak,et al.  Constrained minimization methods , 1966 .

[4]  M. Powell.  A method for nonlinear constraints in minimization problems , 1969 .

[5]  M. Hestenes.  Multiplier and gradient methods , 1969 .

[6]  P. C. Haarhoff,et al.  A New Method for the Optimization of a Nonlinear Function Subject to Nonlinear Constraints , 1970, Comput. J..

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

[8]  K. Mårtensson,et al.  A new approach to constrained function optimization , 1973 .

[9]  A. V. Levy,et al.  Use of the augmented penalty function in mathematical programming problems, part 1 , 1971 .

[10]  A. V. Levy,et al.  Use of the augmented penalty function in mathematical programming problems, part 2 , 1971 .

[11]  K. Narendra,et al.  Constrained optimization problems using multiplier methods , 1972 .

[12]  S. M. Robinson,et al.  A quadratically-convergent algorithm for general nonlinear programming problems , 1972, Math. Program..

[13]  A. V. Levy,et al.  On the method of multipliers for mathematical programming problems , 1972 .

[14]  R. Rockafellar.  The multiplier method of Hestenes and Powell applied to convex programming , 1973 .

[15]  Roger Fletcher,et al.  An exact penalty function for nonlinear programming with inequalities , 1973, Math. Program..

[16]  Floyd J. Gould,et al.  A general saddle point result for constrained optimization , 1973, Math. Program..

[17]  D. Bertsekas.  Convergence rate of penalty and multiplier methods , 1973, CDC 1973.

[18]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[19]  R. Tyrrell Rockafellar,et al.  A dual approach to solving nonlinear programming problems by unconstrained optimization , 1973, Math. Program..

[20]  V. T. Polyak.  TRET''''YAKOV: The method of penalty estimates for conditional extremum problems , 1974 .

[21]  R. Tapia.  Newton’s Method for Optimization Problems with Equality Constraints , 1974 .

[22]  Stephen M. Robinson,et al.  Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[23]  R. Rockafellar.  Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming , 1974 .

[24]  Elijah Polak,et al.  A quadratically convergent primal-dual algorithm with global convergence properties for solving optimization problems with equality constraints , 1975, Math. Program..

[25]  E. Polak.  On The Global Stabilization of Locally Convergent Algorithms for Optimization and Root Finding , 1975 .

[26]  O. Mangasarian.  Unconstrained Lagrangians in Nonlinear Programming , 1975 .

[27]  G. McCormick.  An Arc Method for Nonlinear Programming , 1975 .

[28]  R. Tapia.  A stable approach to Newton's method for general mathematical programming problems inRn , 1975 .

[29]  R. D. Rupp.  On the combination of the multiplier method of Hestenes and Powell with Newton’s method , 1975 .

[30]  D. Bertsekas.  On the method of multipliers for convex programming , 1975 .

[31]  Elijah Polak,et al.  On the global stabilization of locally convergent algorithms , 1976, Autom..

[32]  D. Bertsekas.  On Penalty and Multiplier Methods for Constrained Minimization , 1976 .

[33]  E. Polak,et al.  A second-order method for unconstrained optimization , 1978 .