Newton methods for large-scale linear inequality-constrained minimization

SIAM Journal on Optimization

Volumn 7, Issue 1, 1997, Pages 162-176

  Forsgren, Anders ^a   Murray, Walter ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b Stanford University   (United States)

Author keywords

Large scale minimization; Linear inequality constrained minimization; Linesearch method; Modified Newton method; Negative curvature; Symmetric indefinite factorization

Indexed keywords

EID: 0031542934     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494279122     Document Type: Article

References (28)

1. A. BUCKLEY, An alternative implementation of Goldfarb's minimizatíon algorithm, Math. Prog., 8 (1975), pp. 207-231.
2. J. BURKE, On the identification of active constraints II: The nonconvex case, SIAM J. Numer. Anal., 27 (1990), pp. 1081- 1102.
3. J. V. BURKE AND J. J. MORÉ, On the identification of active constraints, SIAM J. Numer. Anal., 25 (1988), pp. 1197-1211.
4. J. V. BURKE AND J. J. MORÉ. Exposing constraints, SIAM J. Optim., 4 (1994), pp. 573 -595.
5. J. V. BURKE, J. J. MORÉ. AND G. TORALDO, Convergence, properties of trust region methods for linear and convex constraints, Math. Prog., 47 (1990), pp. 305-336.
6. R. H. BYRD AND G. A. SHULTZ, A Practical Class of Globally Convergent Active Set Strategies for Linearly Constrained Optimization, Tech. rep. CU-CS-238-82, Department of Computer Science, University of Colorado at Boulder, Boulder, CO, 1982.
7. P. H. CALAMAI AND J. J. MORÉ, Projected gradient methods for linearly constrained problems, Math. Prog., 39 (1987), pp. 93-116.
8. I. S. DUFF AND J. K. REID, MA27: A Set of Fortran Subroutines for Solving Sparse Symmetric Sets of Linear Equations, Tech. rep. R-10533, (Computer Science and Systems Division, AERE Harwell, Oxford, England, 1982.
9. I. S. DUFF AND J. K. REID, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, 9 (1983), pp. 302-325.
10. R. FLECHER, Practical Methods of Optimization 2nd ed., John Wiley Sons, Chichester, New York, Brisbane, Toronto, Singapore, 1987.
11. A. FORSGREN AND W. MURRAY, Newton methods for large-scale linear equality-constrained minimization, SIAM J. Matrix Anal. Appl., 14 (1993), pp. 560-587.
12. D. M. GAY, A trust-region approach to linearly constrained optimization, in Numerical Analysis, D. F. Griffiths, ed., Lecture Notes in Mathematics 1066, Springer-Verlag, Berlin, Heidelberg, New York, 1984, pp. 72-105.
13. P. E. GlLL AND W. MURRAY, Newton-type methods for unconstrained and linearly constrained optimization, Math. Prog., 7 (1974), pp. 311-350.
14. P. E. GILL, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT, A practical anti-cycling procedure for linearly constrained optimization, Math. Prog., 45 (1989), pp. 437-474.
15. P. E. GILL, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT, A Schur-complement method for sparse quadratic programming, in Reliable Numerical Computation, M. G. Cox and S. J. Hammarling, eds., Oxford University Press, London, England, 1990, pp. 113-138.
16. P. E. GILL, W. MURRAY, M. A. SAUNDERS, AND M. H. WRIGHT, Inertia-controlling methods for general quadratic programming, SIAM Rev., 33 (1991), pp. 1-36.
17. P. E. GILL, W. MURRAY, AND M. H. WRIGHT, Practical Optimization, Academic Press, London, New York, 1981.
18. D. GOLDFARB, Extensions of Davidon's variable, metric, method to maximization under linear inequality and equality constraints, SIAM J. Appl. Math., 17 (1969), pp. 739-764.
19. N. I. M. GOULD, On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem, Math. Prog., 32 (1985), pp. 90-99.
20. G. P. Mc'CORMICK, A second order method for the linearly constrained nonlinear programming problem, in Nonlinear Programming, J. B. Rosen, O. L. Mangasarian, and K. Ritter, eds., Academic Press, New York, London, 1970, pp. 207-243.
21. J. J. MORÉ AND D. C. SORENSEN, On the use of directions of negative curvature in a modified Newton method, Math. Prog., 16 (1979), pp. 1-20.
22. J. J. MORÉ AND D. C. SORENSEN, Newton's method, in Studies in Numerical Analysis, Studies in Mathematics, Vol. 24, G. H. Golub, ed., The Mathematical Association of America, 1984, pp. 29-82.
23. B. A. MURTAGH AND M. A. SAUNDERS, Large-scale linearly constrained optimization, Math. Prog., 14 (1978), pp. 41-72.
24. B. A. MURTAGH AND M. A. SAUNDERS, MINOS 5.4 User's Guide, Tech. rep. SOL 83-20R, Department of Operations Research, Stanford University, Stanford, CA, 1993.
25. K. RITTER, A superlinearly convergent method for minimization problems with linear inequality constraints, Math. Prog., 4 (1973), pp. 44-71.
26. K. RITTER, A method of conjugate direction for linearly constrained nonlinear programming problems, SIAM J. Numer. Anal., 12 (1975), pp. 274-303.
27. K. RITTER, Convergence and superlinear convergence of algorithms for linearly constrained minimization problems, in Nonlinear Optimization: Theory and Algorithms, Part II, L. C. W. Dixon, E. Spedicato, and G. P. Szegö. eds., Birkhäuser, Boston, MA, 1980, pp. 221-251.
28. J. B. ROSEN, The gradient projection method for nonlinear programming. Part I. Linear constraints, SIAM J. Appl. Math., 8 (1960), pp. 181-217.