Because of its vital role of the trust-region subproblem (TRS) in various applications, for example, in optimization and in ill-posed problems, there are several factorization-free algorithms for solving the large-scale sparse TRS. The truncated Lanczos approach proposed by N. I. M. Gould, S. Lucidi, M. Roma, and P. L. Toint [SIAM J. Optim., 1999, 9: 504–525] is a natural extension of the classical Lanczos method for the symmetric linear system and eigenvalue problem and, indeed follows the classical Rayleigh-Ritz procedure for eigenvalue computations. It consists of 1) projecting the original TRS to the Krylov subspaces to yield smaller size TRS’s and then 2) solving the resulted TRS’s to get the approximates of the original TRS. This paper presents a posterior error bounds for both the global optimal value and the optimal solution between the original TRS and their projected counterparts. Our error bounds mainly rely on the factors from the Lanczos process as well as the data of the original TRS and, could be helpful in designing certain stopping criteria for the truncated Lanczos approach.
The authors would like to thank the anonymous referees for their careful reading and comments. This work of the first author was supported in part by the National Natural Science Foundation of China (Grant Nos. 11671246, 91730303, 11371102) and the work of the second author was supported in part by the National Natural Science Foundation of China (Grant Nos. 91730304, 11371102, 91330201).
Rendl R, Wolkowicz H. A semidefinite framework for trust region subproblems with applications to large scale minimization. Math Program, 1997, 77(2): 273–299MathSciNetzbMATHGoogle Scholar
Rojas M, Santos S A, Sorensen D C. Algorithm 873: LSTRS: MATLAB software for large-scale trust-region subproblems and regularization. ACM Trans Math Software, 2008, 34(2): 1–28MathSciNetCrossRefzbMATHGoogle Scholar