On the Solution of Large Quadratic Programming Problems with Bound Constraints

An algorithm is proposed that uses the conjugate gradient method to explore the face of the feasible region defined by the current iterate, and the gradient projection method to move to a different face. It is proved that for strictly convex problems the algorithm converges to the solution, and that if the solution is nondegenerate, then the algorithm terminates at the solution in a finite number of steps. Numerical results are presented for the obstacle problem, the elastic-plastic torsion problem, and the journal bearing problems. On a selection of these problems with dimensions ranging from 5000 to 15,000, the algorithm determines the solution in fewer than 15 iterations, and with a small number of function-gradient evaluations and Hessian-vector products per iteration.

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

[2]  D. Bertsekas.  On the Goldstein-Levitin-Polyak gradient projection method , 1974, CDC 1974.

[3]  G. Cimatti.  On a problem of the theory of lubrication governed by a variational inequality , 1976 .

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

[5]  R. S. Sacher,et al.  On the solution of large, structured linear complementarity problems: The block partitioned case , 1977 .

[6]  R. Cottle,et al.  A SPECIAL CLASS OF LARGE QUADRATIC PROGRAMS , 1978 .

[7]  J. Dunn.  Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes , 1981 .

[8]  H. Mittelmann.  On the efficient solution of nonlinear finite element equations. II , 1981 .

[9]  R. Glowinski,et al.  Numerical Methods for Nonlinear Variational Problems , 1985 .

[10]  Per Lötstedt.  Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body Mechanics , 1984 .

[11]  C. Cryer,et al.  An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems , 1985 .

[12]  R. Glowinski,et al.  Numerical Methods for Nonlinear Variational Problems , 1985 .

[13]  Paul H. Calamai,et al.  Projected gradient methods for linearly constrained problems , 1987, Math. Program..

[14]  J. Pang,et al.  Iterative methods for large convex quadratic programs: a survey , 1987 .

[15]  P. Toint,et al.  Testing a class of methods for solving minimization problems with simple bounds on the variables , 1988 .

[16]  Å. Björck.  A direct method for sparse least squares problems with lower and upper bounds , 1988 .

[17]  J. J. Moré,et al.  On the identification of active constraints , 1988 .

[18]  J. J. Moré,et al.  Algorithms for bound constrained quadratic programming problems , 1989 .

[19]  Laurie A. Hulbert,et al.  A direct active set algorithm for large sparse quadratic programs with simple bounds , 1989, Math. Program..

[20]  Stephen J. Wright.  Implementing proximal point methods for linear programming , 1990 .