Minimization of a large-scale quadratic function subject to a spherical constraint

SIAM Journal on Optimization

Volumn 7, Issue 1, 1997, Pages 141-161

  Sorensen, D C ^a  

^a Rice University   (United States)

Author keywords

Constrained quadratic optimization; Krylov methods; Lanczos method; Regularization; Trust region

Indexed keywords

EID: 0031542396     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623494274374     Document Type: Article

References (18)

1. R. H. BYRD, R. B SCHNABEL, AND G. A. SHULTZ, A trust region algorithm for nonlinearly constrained optimization, SIAM J. Numer. Anal., 24 (1987), pp. 1152- 1170.
2. M. CELIS, J. E. DENNIS, AND R. A. TAPIA, A 4 trust region strategy for nonlinear equality constrained optimization, in Numerical Optimization 1984, SIAM, Philadelphia, PA, 1985, pp. 71-82.
3. A. K. CLINE, C. B. MOLER, G. W. STEWART, AND J. H. WILKINSON, An estimate for the condition number of a matrix, SIAM J. Numer. Anal., 16 (1979), pp. 368-375.
4. M. EL-ALEM, A global convergence theory for the Celis-Dennis-Tapia trust region algorithm for constrained optimization, SIAM J. Numer. Anal., 28 (1991), pp. 266-290.
5. W. GANDER, Least squares with a quadratic constraint, Numer. Math., 36 (1981), pp. 291-307.
6. G. GOLUB AND U. von MATT, Qundratically constraíned least squares and quadratic problems, Numer. Math., 59 (1991), pp. 561-580.
7. R. B. LEHOUCQ, D. C. SORENSEN, P. Vu, AND C. YANG, ARPACK: An implementation of the implicitly re-started Arnoldi iteration that computes some of the eigenvalues and eigenvectors of a large sparse matrix, 1995. Available from ftp.caam.rice.edu under the directory pub/software/ARPACK.
8. W. MENKE, Geophysical Data Analysis: Discrete Inverse Theory, Academic Press, San Diego, CA 1989.
9. J. MORE, Recent developments in algorithms and software for trust region methods, in Mathematical Programming: The State of the Art, A. Bachem, M. Grotschel, and B. Korte, eds., Springer-Verlag, Berlin, New York, 1983, pp. 258-287
10. J. J. MORÉ AND D. C. SORENSEN, Computing a trust region step, SIAM J. Sci. Statist. Comput., 4 (1983), pp. 553-572.
11. C. C. PAIGE, B. N. PARLETT, AND H. A. V. DER VORST, Approximate solutions and eigenvalue bounds from Krylov subspaces,Numer. Linear Algebra Appl., 2 (1995), pp. 115-134.
12. B. PARLETT, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
13. M. J. D POWELL AND Y. YUAN, A trust region algorithm for equality constrained optimization, Math. Programming, 49 (1991), pp. 189-211.
14. D. C. SORENSEN, Newton's method with a model trust region modification, SIAM J. Numer. Anal., 19 (1982), pp. 409-426.
15. D. C. SORENSEN, Implicit application of polynomial filters in ai Arnoldi method, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 357-385.
16. T. STEIHAUG, The conjugate gradient method and trust regions in large scale optimization, SIAM J. Numer. Anal., 20 (1983), pp. 626-637.
17. A. TARANTOLA, Inverse Problem Theory, Elsevier, Amsterdam, 1987.
18. P. L. TOINT, Towards an efficient sparsity exploiting neuton method for minimization, in Sparse Matrices and Their Uses, I. S. Duff, ed., Academic Press, New York, 1981, pp. 7-87.