A sparse sequential quadratic programming algorithm

Described here is the structure and theory for a sequential quadratic programming algorithm for solving sparse nonlinear optimization problems. Also provided are the details of a computer implementation of the algorithm along with test results. The algorithm maintains a sparse approximation to the Cholesky factor of the Hessian of the Lagrangian. The solution to the quadratic program generated at each step is obtained by solving a dual quadratic program using a projected conjugate gradient algorithm. An updating procedure is employed that does not destroy sparsity.

[1]  G. W. Stewart,et al.  A Modification of Davidon's Minimization Method to Accept Difference Approximations of Derivatives , 1967, JACM.

[2]  Boris Polyak.  The conjugate gradient method in extremal problems , 1969 .

[3]  G. R. Walsh,et al.  Methods Of Optimization , 1976 .

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

[5]  D. Goldfarb.  Factorized variable metric methods for unconstrained optimization , 1976 .

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

[7]  D. O’Leary.  A generalized conjugate gradient algorithm for solving a class of quadratic programming problems , 1977 .

[8]  P. Toint.  On sparse and symmetric matrix updating subject to a linear equation , 1977 .

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

[10]  T. M. Williams,et al.  Practical Methods of Optimization. Vol. 1: Unconstrained Optimization , 1980 .

[11]  Leon S. Lasdon,et al.  Feature Article - Survey of Nonlinear Programming Applications , 1980, Oper. Res..

[12]  D. Shanno.  On variable-metric methods for sparse Hessians , 1980 .

[13]  P. Gill,et al.  QP-Based Methods for Large-Scale Nonlinearly Constrained Optimization. , 1981 .

[14]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[15]  O. Mangasarian.  Iterative Solution of Linear Programs , 1981 .

[16]  K. Schittkowski,et al.  On the Convergence of a Sequential Quadratic Programming Method with an Augmented Lagrangian Line Search Functions. , 1982 .

[17]  Michael A. Saunders,et al.  A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints , 1982 .

[18]  J. Pasciak,et al.  Computer solution of large sparse positive definite systems , 1982 .

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

[20]  Kyung K. Choi,et al.  Pshenichny’s Linearization Method for Mechanical System Optimization , 1983 .

[21]  Mukund N. Thapa,et al.  Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods , 1983, Math. Program..

[22]  Albert G. Buckley,et al.  QN-like variable storage conjugate gradients , 1983, Math. Program..

[23]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

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

[25]  J. Tolle,et al.  A Sequential Quadratic Programming Algorithm for Solving Large, Sparse Nonlinear Programs. , 1984 .

[26]  Thomas F. Coleman,et al.  Software for estimating sparse Jacobian matrices , 1984, ACM Trans. Math. Softw..

[27]  R. Fletcher.  Practical Methods of Optimization , 1988 .