A reflective Newton method for minimizing a quadratic function subject to bounds on some of the variables

SIAM Journal on Optimization

Volumn 6, Issue 4, 1996, Pages 1040-1058

  Coleman, Thomas F ^a   Li, Yuying ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Interior Newton method; Interior point method; Quadratic programming

Indexed keywords

EID: 0030493826     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494240456     Document Type: Article

References (30)

1. Å. BJORCK, A direct method for sparse least squares problems with lower and upper bounds, Numer. Math., 54 (1988), pp. 19-32.
2. M. A. BRANCH, T. F. COLEMAN, AND Y. LI, A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems, Tech. report TR95-1525, Department of Computer Science, Cornell University, Ithaca, NY, 1995.
3. R. H. BYRD, R. B. SCHNABEL, AND G. SHULTZ, Approximate solution of the trust region problem by minimization over two-dimensional subspaces, Math. Programming, 40 (1988). pp. 247-263.
4. T. F. COLEMAN AND L. A. HULBERT, A direct active set algorithm for large sparse quadratic programs with simple bounds, Math. Programming, 45 (1989), pp. 373-406.
5. _, A globally and superlinearly convergent algorithm for convex programs with simple bounds, SIAM J. Optim., 3 (1993), pp. 298-321.
6. T. F. COLEMAN AND Y. LI, A quadratically-convergent algorithm for the linear programming problem with lower and upper bounds, in Large-Scale Numerical Optimization, T. F. Coleman and Y. Li, eds., SIAM, Philadelphia, PA, 1990, pp. 49-57.
7. ∞ problems, SIAM J. Numer. Anal., 29 (1992), pp. 1166-1186.
8. 1 problems, Math. Programming, 56 (1992), pp. 189-222.
9. _, On the convergence of reflective Newton methods for large-scale nonlinear minimization subject to bounds, Math. Programming, 67 (1994), pp. 189-224.
10. A. R. CONN. N. I. M. GOULD, AND P. L. TOINT, Testing a class of methods for solving minimization problems with simple bounds on the variables, Math. Comp., 50 (1988), pp. 399-430.
11. R. S. DEMBO AND U. TULOWITZKI, On the Minimization of Quadratic Functions Subject to Box Constraints, Tech. report B 71, School of Organization and Management, Yale University, New Haven, CT, 1983.
12. J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization, Prentice-Hall, Englewood Cliffs, NJ, 1983.
13. F. FACCHINEI AND S. LUCIDI, A class of penalty functions for optimization problems with bound constraints, Optimization, 26 (1992), pp. 239-259.
14. R. FLETCHER AND M. P. JACKSON, Minimization of a quadratic function of many variables subject only to lower and upper bounds, J. Inst. Math. Appl., 14 (1974), pp. 159-174.
15. A. GEORGE AND J. W.-H. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewoods Cliffs, NJ, 1981.
16. J. GILBERT, C. MOLER, AND R. SCHREIBER, Sparse matrices in MATLAB: Design and implementation, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 333-356.
17. P. GILL AND W. MURRAY, Minimization Subject to Bounds on the Variables, Tech. report NAC 71, National Physical Laboratory, England, 1976.
18. D. GOLDFARB, Curvilinear path steplength algorithms for minimization algorithms which use directions of negative curvature, Math. Programming, 18 (1980), pp. 31-40.
19. C.-G. HAN, P. M. PARDALOS, AND Y. YE, Computational aspects of an interior point alqorithm for quadratic programming problems with box constraints, in Large-Scale Numerical Optimization, T. F. Coleman and Y. Li, eds., SIAM, Philadelphia, PA, 1990, pp. 92-112.
20. J. J. JÚDICE AND F. M. PIRES, Direct methods for convex quadratic programs subject to box constraints, Investigacao Peracional, 9 (1989), pp. 23-56.
21. p problems, SIAM J. Optim., 3 (1993), pp. 609-629.
22. P. LOTSTEDT, Solving the minimal least squares problem subject to bounds on the variables, BIT, 24 (1984), pp. 206-224.
23. C. B. MOLER, J. LITTLE, S. BANGERT, AND S. KLEIMAN, ProMatlab User's Guide, MathWorks, Sherborn, MA, 1987.
24. J. J. MORÉ AND G. TORALDO, Algorithms for bound constrained quadratic programming problems, Numer. Math., 55 (1989), pp. 377-400.
25. _, On the solution of large quadratic programming problems with bound constraints, SIAM J. Optim., 1 (1991), pp. 93-113.
26. D. P. O'LEARY, A generalized conjugate gradient algorithm for solving a class of quadratic programming problems, Linear Algebra Appl., 34 (1980), pp. 371-399.
27. U. OREBORN, A direct method for sparse nonnegative least squares problems, Ph.D. thesis, Department of Mathematics, Linköping University, Linköping, Sweden, 1986.
28. S. POPE, Application of the velocity-dissipation PDF model to inhomogeneous turbulent flows, Phys. Fluids A, 3 (1991), pp. 1947-1957.
29. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal, 20 (1983), pp. 626-637.
30. E. K. YANG AND J. W. TOLLE, A class of methods for solving large convex quadratic programs subject to box constraints, Math. Programming, 51 (1991), pp. 223-228.