A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the Variables

We propose a new algorithm, a reflective Newton method, for the minimization of a quadratic function of many variables subject to upper and lower bounds on some of the variables. This method applies to a general (indefinite) quadratic function, for which a local minimizer subject to bounds is required, and is particularly suitable for the large-scale problem. Our new method exhibits strong convergence properties, global and quadratic convergence, and appears to have significant practical potential. Strictly feasible points are generated. Experimental results on moderately large and sparse problems support the claim of practicality for large-scale problems.

[1]  R. Fletcher,et al.  Minimization of a Quadratic Function of Many Variables Subject only to Lower and Upper Bounds , 1974 .

[2]  T. Coleman,et al.  A Quadratically-Convergent Algorithm for the Linear Programming Problem with Lower and Upper Bounds , 1990 .

[3]  T. Steihaug.  The Conjugate Gradient Method and Trust Regions in Large Scale Optimization , 1983 .

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

[5]  Per Lötstedt.  Solving the minimal least squares problem subject to bounds on the variables , 1984 .

[6]  Yuying Li,et al.  A Globally Convergent Method for lp Problems , 1991, SIAM J. Optim..

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

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

[9]  S. Lucidi,et al.  A Class of penalty functions for optimization problema with bound constraints , 1992 .

[10]  Jon W. Tolle,et al.  A class of methods for solving large, convex quadratic programs subject to box constraints , 1991, Math. Program..

[11]  Donald Goldfarb,et al.  Curvilinear path steplength algorithms for minimization which use directions of negative curvature , 1980, Math. Program..

[12]  Richard H. Byrd,et al.  Approximate solution of the trust region problem by minimization over two-dimensional subspaces , 1988, Math. Program..