A Schur-complement method for sparse quadratic programming

Abstract : In applying active-set methods to sparse quadratic programs, it is desirable to utilize existing sparse-matrix techniques. The authors describe a quadratic programming method based on the classical Schur complement. Its key feature is that much of the linear algebraic work associated wtih an entire sequence of iterations involves a fixed sparse factorization. Updates are performed at every iteration to the factorization of a smaller matrix, which may be treated as dense or sparse. The use of a fixed sparse factorization allows an off-the shelf sparse equation solver to be used repeatedly. This feature is ideally suited to problems with structure that can be exploited by a specialized factorization. Moreover, improvements in efficiency derived from exploiting new parallel and vector computer architectures are immediately applicable. An obvious application of the method is in sequential quadratic programming methods for nonlinearly constrained optimization, which require solution of a sequence of closely related quadratic programming subproblems. Some ways in which the known relationship between successive problems can be exploited are discussed. Keywords: Supercomputers; Variables; Computations.

[1]  J. H. Wilkinson.  The algebraic eigenvalue problem , 1966 .

[2]  J. Bunch,et al.  Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[3]  R. Fletcher.  A General Quadratic Programming Algorithm , 1971 .

[4]  J. Bunch,et al.  Some stable methods for calculating inertia and solving symmetric linear systems , 1977 .

[5]  R. Cottle.  On manifestations of the Schur complement , 1975 .

[6]  Alexander Meeraus,et al.  Matrix augmentation and partitioning in the updating of the basis inverse , 1977, Math. Program..

[7]  D. Sorensen.  Updating the Symmetric Indefinite Factorization with Applications in a Modified Newton's Method , 1977 .

[8]  Philip E. Gill,et al.  Numerically stable methods for quadratic programming , 1978, Math. Program..

[9]  Michael A. Saunders,et al.  Large-scale linearly constrained optimization , 1978, Math. Program..

[10]  Arthur Djang.  Algorithmic equivalence in quadratic programming , 1979 .

[11]  Alexander Meeraus,et al.  Matrix augmentation and structure preservation in linearly constrained control problems , 1980, Math. Program..

[12]  Iain S. Duff,et al.  MA27 -- A set of Fortran subroutines for solving sparse symmetric sets of linear equations , 1982 .

[13]  T. M. Williams.  Practical Methods of Optimization. Vol. 2 — Constrained Optimization , 1982 .

[14]  T. Chan.  Deflated Decomposition of Solutions of Nearly Singular Systems , 1984 .

[15]  Michael J. Best,et al.  Equivalence of some quadratic programming algorithms , 1984, Math. Program..

[16]  H. Happ,et al.  Quadratically Convergent Optimal Power Flow , 1984, IEEE Transactions on Power Apparatus and Systems.

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

[18]  P. Gill,et al.  Sparse Matrix Methods in Optimization , 1984 .

[19]  Michael A. Saunders,et al.  Software and its relationship to methods , 1984 .

[20]  Nicholas I. M. Gould,et al.  On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem , 1985, Math. Program..

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

[22]  Stephen C. Hoyle.  A Single-Phase Method for Quadratic Programming. , 1985 .

[23]  Senad Busovaca.  Handling degeneracy in a nonlinear l(,1) algorithm , 1985 .

[24]  T. Coleman,et al.  The null space problem I. complexity , 1986 .

[25]  Simon French,et al.  Finite Algorithms in Optimization and Data Analysis , 1986 .

[26]  I. Duff,et al.  Direct Methods for Sparse Matrices , 1987 .

[27]  J. Gilbert.  Computing a sparse basis for the null space , 1987 .

[28]  Barry W. Peyton,et al.  Progress in Sparse Matrix Methods for Large Linear Systems On Vector Supercomputers , 1987 .

[29]  P. Gill,et al.  Maintaining LU factors of a general sparse matrix , 1987 .

[30]  D. M. Ryan,et al.  On the solution of highly degenerate linear programmes , 1988, Math. Program..

[31]  Michael A. Saunders,et al.  A practical anti-cycling procedure for linearly constrained optimization , 1989, Math. Program..