Gauss quadrature applied to trust region computations

Numerical Algorithms

Volumn 34, Issue 1, 2003, Pages 85-102

  Calvetti, Daniela ^a   Reichel, Lothar ^b  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b KENT STATE UNIVERSITY   (United States)

Author keywords

Bounds; Lanczos process; Optimization; Quasi Newton method

Indexed keywords

EID: 0346463241     PISSN: 10171398     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026130310913     Document Type: Article

References (19)

1. D. Calvetti, G.H. Golub and L. Reichel, Estimation of the L-curve via Lanczos bidiagonalization, BIT 39 (1999) 603-619.
2. A.R. Conn, N.I.M. Gould and P.L. Toint, Trust Region Methods (SIAM, Philadelphia, PA, 2000).
3. J.E. Dennis and R.B. Schnabel, Numerical Methods for Unconstraint Optimization (SIAM, Philadelphia, PA, 1996).
4. D.M. Gay, Computing optimal locally constrained steps, SIAM J. Sci. Statist. Comput. 2 (1981) 186-197.
5. G.H. Golub and G. Meurant, Matrices, moments and quadrature, in: Numerical Analysis 1993, eds. D.F. Griffiths and G.A. Watson (Longman, Essex, 1994) pp. 105-156.
6. G.H. Golub and C.F. Van Loan, Matrix Computations, 3rd ed. (John Hopkins Univ. Press, Baltimore, MD, 1996).
7. G.H. Golub and U. von Matt, Quadratically constrained least squares and quadratic problems, Numer. Math. 59 (1991) 561-580.
8. N.I.M. Gould, S. Lucidi, M. Roma and P.L. Toint, Solving the trust-region subproblem using the Lanczos method, SIAM J. Optim. 9 (1999) 504-525.
9. W.W. Hager, Minimizing a quadratic over a sphere, SIAM J. Optim. 12 (2001) 188-208.
10. M. Hanke, A note on Tikhonov regularization of large linear problems, BIT, to appear.
11. C.T. Kelley, Iterative Methods for Optimization (SIAM, Philadelphia, PA, 1999).
12. J. J. Moré, Recent developments in algorithms and software for trust region methods, in: Mathematical Programming: The State of the Art, eds. A. Bachem, M. Grötschel and B. Korte (Springer, Berlin, 1983) pp. 258-287.
13. J.J. Moré and D.C. Sorensen, Computing a trust region step, SIAM J. Sci. Statist. Comput. 4 (1983) 553-572.
14. J. Nocedal and S.J. Wright, Numerical Optimization (Springer, New York, 1999).
15. M. Rojas, S.A. Santos and D.C. Sorensen, A new matrix-free algorithm for the large-scale trust-region subproblem, SIAM J. Optim. 11 (2000) 611-646.
16. D.C. Sorensen, Newton's method with a model trust region modification, SIAM J. Numer. Anal. 19 (1982) 409-426.
17. T. Steihaug, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal. 20 (1983) 626-637.
18. P.L. Toint, Towards an efficient sparsity exploiting Newton method for minimization, in: Sparse Matrices and Their Uses, ed. I.S. Duff (Academic Press, London, 1981) pp. 57-88.
19. Y. Yuan, On the truncated conjugate gradient method, Math. Programing Ser. A 87 (2000) 561-573.