A numerically stable dual method for solving strictly convex quadratic programs

An efficient and numerically stable dual algorithm for positive definite quadratic programming is described which takes advantage of the fact that the unconstrained minimum of the objective function can be used as a starting point. Its implementation utilizes the Cholesky and QR factorizations and procedures for updating them. The performance of the dual algorithm is compared against that of primal algorithms when used to solve randomly generated test problems and quadratic programs generated in the course of solving nonlinear programming problems by a successive quadratic programming code (the principal motivation for the development of the algorithm). These computational results indicate that the dual algorithm is superior to primal algorithms when a primal feasible point is not readily available. The algorithm is also compared theoretically to the modified-simplex type dual methods of Lemke and Van de Panne and Whinston and it is illustrated by a numerical example.

[1]  E. Beale.  ON MINIMIZING A CONVEX FUNCTION SUBJECT TO LINEAR INEQUALITIES , 1955 .

[2]  E. Beale.  On quadratic proramming , 1959 .

[3]  P. Wolfe.  THE SIMPLEX METHOD FOR QUADRATIC PROGRAMMING , 1959 .

[4]  C. Panne,et al.  Quadratic Programming as an Extension of Classical Quadratic Maximization , 1960 .

[5]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[6]  Klaus Ritter.  Ein Verfahren zur Lösung parameterabhängiger, nichtlinearer Maximum-Probleme , 1962, Unternehmensforschung.

[7]  C. E. Lemke,et al.  A Method of Solution for Quadratic Programs , 1962 .

[8]  C. Panne,et al.  The Simplex and the Dual Method for Quadratic Programming , 1964 .

[9]  J. B. Rosen,et al.  Construction of nonlinear programming test problems , 1965 .

[10]  J. Ben Rosen,et al.  Pracniques: construction of nonlinear programming test problems , 1965, Commun. ACM.

[11]  G. Dantzig,et al.  COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .

[12]  K. Ritter,et al.  A Parametric Method for Semidefinite Quadratic Programs , 1969 .

[13]  G. Golub,et al.  Numerical techniques in mathematical programming , 1970 .

[14]  B. Eaves.  On Quadratic Programming , 1971 .

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

[16]  J. Stoer.  On the Numerical Solution of Constrained Least-Squares Problems , 1971 .

[17]  C. Lawson,et al.  Solving least squares problems , 1976, Classics in applied mathematics.

[18]  G. Stewart,et al.  Reorthogonalization and stable algorithms for updating the Gram-Schmidt QR factorization , 1976 .

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

[20]  Donald Goldfarb,et al.  Matrix factorizations in optimization of nonlinear functions subject to linear constraints , 1976, Math. Program..

[21]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[22]  J. Stoer,et al.  A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes , 1978 .

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

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

[25]  Robert Mifflin,et al.  A stable method for solving certain constrained least squares problems , 1979, Math. Program..

[26]  K. Schittkowski.  Nonlinear Programming Codes: Information, Tests, Performance , 1980 .

[27]  A. Idnani.  Numerically stable dual projection methods for solving positive definite quadratic programs , 1980 .

[28]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[29]  M. J. D. Powell,et al.  An example of cycling in a feasible point algorithm , 1981, Math. Program..

[30]  Shih-Ping Han.  SOLVING QUADRATIC PROGRAMS BY AN EXACT PENALTY FUNCTION , 1981 .

[31]  D. Goldfarb,et al.  Dual and primal-dual methods for solving strictly convex quadratic programs , 1982 .