Skip to main content
SpringerLink
Log in

Error bounds of Lanczos approach for trust-region subproblem

  • Research Article
  • Published:
Frontiers of Mathematics in China Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Conn A R, Gould N I M, Toint P L. Trust-Region Methods. Philadelphia: SIAM, 2000

    Book  MATH  Google Scholar 

  2. Demmel J. Applied Numerical Linear Algebra. Philadelphia: SIAM, 1997

    Book  MATH  Google Scholar 

  3. Gay D M. Computing optimal locally constrained steps. SIAM J Sci Statist Comput, 1981, 2: 186–197

    Article  MathSciNet  MATH  Google Scholar 

  4. Golub G H, Van Loan C F. Matrix Computations. 3rd ed. Baltimore: Johns Hopkins University Press, 1996

    MATH  Google Scholar 

  5. Golub G H, von Matt U. Quadratically constrained least squares and quadratic problems. Numer Math, 1991, 59: 561–580

    Article  MathSciNet  MATH  Google Scholar 

  6. Gould N I M, Lucidi S, Roma M, Toint P L. Solving the trust-region subproblem using the Lanczos method. SIAM J Optim, 1999, 9: 504–525

    Article  MathSciNet  MATH  Google Scholar 

  7. Hager W W. Minimizing a quadratic over a sphere. SIAM J Optim, 2001, 12: 188–208

    Article  MathSciNet  MATH  Google Scholar 

  8. Hager W W, Krylyuk Y. Graph partitioning and continuous quadratic programming. SIAM J Discrete Math, 1999, 12(4): 500–523

    Article  MathSciNet  MATH  Google Scholar 

  9. Li C K, Li R C. A note on eigenvalues of perturbed Hermitian matrices. Linear Algebra Appl, 2005, 395: 183–190

    Article  MathSciNet  MATH  Google Scholar 

  10. Li R C. On Meinardus’ examples for the conjugate gradient method. Math Comp, 2008, 77(261): 335–352

    Article  MathSciNet  MATH  Google Scholar 

  11. Li R C. Sharpness in rates of convergence for symmetric Lanczos method. Math Comp, 2010, 79(269): 419–435

    Article  MathSciNet  MATH  Google Scholar 

  12. Li R C, Zhang L H. Convergence of block Lanczos method for eigenvalue clusters. Numer Math, 2015, 131: 83–113

    Article  MathSciNet  MATH  Google Scholar 

  13. Lukšan L, Matonoha C, Vlček J. On Lagrange multipliers of trust-region subproblems. BIT, 2008, 48: 763–768

    Article  MathSciNet  MATH  Google Scholar 

  14. Moré J, Sorensen D C. Computing a trust region step. SIAM J Sci Statist Comput, 1983, 4(3): 553–572

    Article  MathSciNet  MATH  Google Scholar 

  15. Nocedal J, Wright S. Numerical Optimization. 2nd ed. Berlin: Springer, 2006

    MATH  Google Scholar 

  16. Parlett B N. The Symmetric Eigenvalue Problem. Philadelphia: SIAM, 1998

    Book  MATH  Google Scholar 

  17. Rendl R, Wolkowicz H. A semidefinite framework for trust region subproblems with applications to large scale minimization. Math Program, 1997, 77(2): 273–299

    MathSciNet  MATH  Google Scholar 

  18. 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–28

    Article  MathSciNet  MATH  Google Scholar 

  19. Rojas M, Santos S A, Sorensen D C. A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM J Optim, 2000, 11: 611–646

    Article  MathSciNet  MATH  Google Scholar 

  20. Rojas M, Sorensen D C. A trust-region approach to the regularization of large-scale discrete forms of ill-posed problems. SIAM J Sci Comput, 2002, 23: 1843–1861

    Article  MathSciNet  MATH  Google Scholar 

  21. Saad Y. Iterative Methods for Sparse Linear Systems. 2nd ed. Philadelphia: SIAM, 2003

    Book  MATH  Google Scholar 

  22. Sorensen D C. Minimization of a large-scale quadratic function subject to a spherical constraint. SIAM J Optim, 1997, 7: 141–161

    Article  MathSciNet  MATH  Google Scholar 

  23. Steihaug T. The conjugate gradient method and trust regions in large scale optimization. SIAM J Numer Anal, 1983, 20: 626–637

    Article  MathSciNet  MATH  Google Scholar 

  24. Tarantola A. Inverse Problem Theory. Amsterdam: Elsevier, 1987

    MATH  Google Scholar 

  25. Tikhonov A N. Regularization of incorrectly posed problems. Soviet Math, 1963, 4: 1624–1627

    MATH  Google Scholar 

  26. Toint P L. Towards an efficient sparsity exploiting Newton method for minimization. In: Duff I, ed. Sparse Matrices and Their Uses. London: Academic Press, 1981, 57–88

    Google Scholar 

  27. Zhang L H, Shen C G, Li R C. On the generalized Lanczos trust-region method. SIAM J Optim, 2017, 27(3): 2110–2142

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

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).

Author information

Authors and Affiliations

  1. School of Mathematics, Shanghai University of Finance and Economics, Shanghai, 200433, China

    Leihong Zhang & Jiang Feng

  2. Shanghai Key Laboratory of Financial Information Technology, Shanghai University of Finance and Economics, Shanghai, 200433, China

    Leihong Zhang

  3. School of Mathematical Sciences, Fudan University, Shanghai, 200433, China

    Weihong Yang

  4. College of Science, University of Shanghai for Science and Technology, Shanghai, 200093, China

    Chungen Shen

Authors
  1. Leihong Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weihong Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chungen Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jiang Feng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Leihong Zhang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, L., Yang, W., Shen, C. et al. Error bounds of Lanczos approach for trust-region subproblem. Front. Math. China 13, 459–481 (2018). https://doi.org/10.1007/s11464-018-0687-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11464-018-0687-y

Keywords

MSC

Search

Navigation