Gould, Nicholas I. M.; Lucidi, Stefano; Roma, Massimo; Toint, Philippe L. Solving the trust-region subproblem using the Lanczos method. (English) Zbl 1047.90510 SIAM J. Optim. 9, No. 2, 504-525 (1999). Authors’ summary: The approximate minimization of a quadratic function within an ellipsoidal trust region is an important subproblem for many nonlinear programming methods. When the number of variables is large, the most widely used strategy is to trace the path of conjugate gradient iterates either to convergence or until it reaches the trust-region boundary. We investigate ways of continuing the process once the boundary has been encountered. The key is to observe that the trust-region problem within the currently generated Krylov subspace has a very special structure which enables it to be solved very efficiently. We compare the new strategy with existing methods. The resulting software package is available as HSL-VF05 within the Harwell Subroutine Library. Reviewer: Eugene L. Allgower (Fort Collins) Cited in 6 ReviewsCited in 104 Documents MSC: 90C30 Nonlinear programming 90C20 Quadratic programming 65K05 Numerical mathematical programming methods 65F10 Iterative numerical methods for linear systems Keywords:convergence acceleration; nonlinear systems; fixed point iteration; conjugate gradients; preconditioning Software:HSL; CUTEr; LANCELOT; GQTPAR; HSL-VF05 PDFBibTeX XMLCite \textit{N. I. M. Gould} et al., SIAM J. Optim. 9, No. 2, 504--525 (1999; Zbl 1047.90510) Full Text: DOI