Solving the trust-region subproblem using the Lanczos method

SIAM Journal on Optimization

Volumn 9, Issue 2, 1999, Pages 504-525

  Gould, Nicholas I M ^a   Lucidi, Stefano ^b   Roma, Massimo ^b   Toint, Philippe L ^c  

^a RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF NAMUR   (Belgium)

Author keywords

Conjugate gradients; Lanczos method; Preconditioning; Trust region subproblem

Indexed keywords

EID: 0033437435     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497322735     Document Type: Article

References (23)

1. I. BONGARTZ, A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, CUTE: Constrained and unconstrained testing environment, ACM Trans. Math. Software, 21 (1995), pp. 123-160.
2. A. R. CONN, N. I. M. GOULD, AND PH. L. TOINT, LANCELOT: A Fortran Package for Large-Scale Nonlinear Optimization (Release A), Springer Series in Computational Mathematics 17, Springer-Verlag, Heidelberg, Berlin, New York, 1992.
3. J E. DENNIS AND H. H. W. MEI, Two new unconstrained optimization algorithms which use function and gradient values, J. Optim. Theory Appl., 28 (1979), pp. 453-482.
4. D. M. GAY, Computing optimal locally constrained steps, SIAM J. Sei. Statist. Comput., 2 (1981), pp. 186-197.
5. S. M. GOLDFELDT, R. E. QUANDT, AND H. F. TROTTER, Maximization by quadratic hill-climbing, Econometrica, 34 (1966), pp. 541-551.
6. HARWELL SUBROUTINE LIBRARY, A Catalogue of Subroutines (Release 13), AEA Technology, Harwell, Oxfordshire, England, 1998, to appear.
7. M. D. HEBDEN, An Algorithm for Minimization Using Exact Second Derivatives, Tech. Rep. T. P. 515, AERE Harwell Laboratory, Harwell, UK, 1973.
8. S. LUCIDI AND M. ROMA, Numerical experience with new truncated Newton methods in large scale unconstrained optimization, Comput. Optim. Appl., 7 (1997), pp. 71-87.
9. J. J. MORÉ AND D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
10. S. G. NASH, Newton-type minimization via the Lanczos method, SIAM J. Numer. Anal., 21 (1984), pp. 770-788.
11. B. N. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980; reprinted by SIAM, Philadelphia, PA, 1998.
12. B. N. PARLETT AND J. K. REID, Tracking the progress of the Lanczos algorithm for large symmetric eigenproblems, J. Inst. Math. Appl., 1 (1981), pp. 135-155.
13. M. J. D. POWELL, A new algorithm for unconstrained optimization, in Nonlinear Programming, J. B. Rosen, O. L. Mangasarian, and K. Ritter, eds., Academic Press, London, New York, 1970, pp. 31-65.
14. M. J. D. POWELL, Convergence properties of a class of minimization algorithms, in Nonlinear Programming 2, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, eds., Academic Press, London, New York, 1975, pp. 1-27.
15. F. RENDL, R. J. VANDERBEI, AND H. WOLKOWICZ, Max-min eigenvalue problems, primal-dual interior point algorithms, and trust region subproblems, Optim. Methods Softw., 5 (1995), pp. 1-16.
16. F. RENDL AND H. WOLKOWICZ, A semidefinite framework for trust region subproblems with applications to large scale minimization, Math. Programming, Series B, 77 (1997), pp. 273-299.
17. S. A. SANTOS AND D. C. SORENSEN, A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem, Tech. Rep. TR95-20, Department of Computational and Applied Mathematics, Rice University, Houston, Texas, 1995.
18. R. B. SCHNABEL AND E. ESKOW, A new modified Cholesky factorization, SIAM J. Sci. Statist. Comput., 11 (1990), pp. 1136-1158.
19. G. A. SHULTZ, R. B. SCHNABEL, AND R. H. BYRD, A family of trust-region-based algorithms for unconstrained minimization with strong global convergence properties, SIAM J. Numer. Anal., 22 (1985), pp. 47-67.
20. D. C. SORENSEN, Newton's method with a model trust modification, SIAM J. Numer. Anal., 19 (1982), pp. 409-426.
21. D. C. SORENSEN, Minimization of a large-scale quadratic function subject to a spherical constraint, SIAM J. Optim., 7 (1997), pp. 141-161.
22. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
23. PH. L. TOINT, Towards an efficient sparsity exploiting Newton method for minimization, in Sparse Matrices and Their Uses, I. S. Duff, ed., Academic Press, London, New York, 1981, pp. 57-88.