An analysis of reduced Hessian methods for constrained optimization

We study the convergence properties of reduced Hessian successive quadratic programming for equality constrained optimization. The method uses a backtracking line search, and updates an approximation to the reduced Hessian of the Lagrangian by means of the BFGS formula. Two merit functions are considered for the line search: theℓ1 function and the Fletcher exact penalty function. We give conditions under which local and superlinear convergence is obtained, and also prove a global convergence result. The analysis allows the initial reduced Hessian approximation to be any positive definite matrix, and does not assume that the iterates converge, or that the matrices are bounded. The effects of a second order correction step, a watchdog procedure and of the choice of null space basis are considered. This work can be seen as an extension to reduced Hessian methods of the well known results of Powell (1976) for unconstrained optimization.

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

[2]  J. J. Moré,et al.  Quasi-Newton Methods, Motivation and Theory , 1974 .

[3]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[4]  Shih-Ping Han,et al.  Superlinearly convergent variable metric algorithms for general nonlinear programming problems , 1976, Math. Program..

[5]  R. Tapia.  Diagonalized multiplier methods and quasi-Newton methods for constrained optimization , 1977 .

[6]  W. Murray,et al.  Projected Lagrangian Methods Based on the Trajectories of Penalty and Barrier Functions. , 1978 .

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

[8]  S. Glad.  Properties of updating methods for the multipliers in augmented Lagrangians , 1979 .

[9]  Andrew R. Conn,et al.  Nonlinear programming via an exact penalty function: Global analysis , 1982, Math. Program..

[10]  D. Gabay.  Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization , 1982 .

[11]  D. Mayne,et al.  A surperlinearly convergent algorithm for constrained optimization problems , 1982 .

[12]  C. Lemaréchal,et al.  The watchdog technique for forcing convergence in algorithms for constrained optimization , 1982 .

[13]  P. Boggs,et al.  A family of descent functions for constrained optimization , 1984 .

[14]  Danny C. Sorensen,et al.  A note on the computation of an orthonormal basis for the null space of a matrix , 1982, Math. Program..

[15]  T. Coleman,et al.  On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem , 1984 .

[16]  Richard H Byrd,et al.  On the convergence of constrained optimization methods with accurate Hessian information on a subspace , 1990 .

[17]  Richard H. Byrd,et al.  An example of irregular convergence in some constrained optimization methods that use the projected hessian , 1985, Math. Program..

[18]  Michael A. Saunders,et al.  Properties of a representation of a basis for the null space , 1985, Math. Program..

[19]  Ya-Xiang Yuan,et al.  An only 2-step Q-superlinear convergence example for some algorithms that use reduced hessian approximations , 1985, Math. Program..

[20]  Richard H. Byrd,et al.  Continuity of the null space basis and constrained optimization , 1986, Math. Program..

[21]  Ya-Xiang Yuan,et al.  A recursive quadratic programming algorithm that uses differentiable exact penalty functions , 1986, Math. Program..

[22]  J. Nocedal,et al.  Global Convergence of a Class of Quasi-newton Methods on Convex Problems, Siam Some Global Convergence Properties of a Variable Metric Algorithm for Minimization without Exact Line Searches, Nonlinear Programming, Edited , 1996 .

[23]  R. Fontecilla.  Local convergence of secant methods for nonlinear constrained optimization , 1988 .

[24]  J. Nocedal,et al.  A tool for the analysis of Quasi-Newton methods with application to unconstrained minimization , 1989 .

[25]  Thomas F. Coleman,et al.  Partitioned quasi-Newton methods for nonlinear equality constrained optimization , 1992, Math. Program..