Error bounds of Lanczos approach for trust-region subproblem

被引:0
|
作者
Leihong Zhang
Weihong Yang
Chungen Shen
Jiang Feng
机构
[1] Shanghai University of Finance and Economics,School of Mathematics
[2] Shanghai University of Finance and Economics,Shanghai Key Laboratory of Financial Information Technology
[3] Fudan University,School of Mathematical Sciences
[4] University of Shanghai for Science and Technology,College of Science
来源
关键词
Trust-region method; trust-region subproblem (TRS); Lanczos method; Steihaug–Toint conjugate-gradient iteration; error bound; 90C20; 90C06; 65F10; 65F15; 65F35;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
页码:459 / 481
页数:22
相关论文
共 50 条
  • [1] Error bounds of Lanczos approach for trust-region subproblem
    Zhang, Leihong
    Yang, Weihong
    Shen, Chungen
    Feng, Jiang
    [J]. FRONTIERS OF MATHEMATICS IN CHINA, 2018, 13 (02) : 459 - 481
  • [2] THE CONVERGENCE OF THE GENERALIZED LANCZOS TRUST-REGION METHOD FOR THE TRUST-REGION SUBPROBLEM
    Jia, Zhongxiao
    Wang, Fa
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2021, 31 (01) : 887 - 914
  • [3] A NESTED LANCZOS METHOD FOR THE TRUST-REGION SUBPROBLEM
    Zhang, Lei-Hong
    Shen, Chungen
    [J]. SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2018, 40 (04): : A2005 - A2032
  • [4] Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
    Feng, Bo
    Wu, Gang
    [J]. APPLIED NUMERICAL MATHEMATICS, 2022, 181 : 388 - 402
  • [5] A BLOCK LANCZOS METHOD FOR THE EXTENDED TRUST-REGION SUBPROBLEM
    Song, Liqiang
    Yang, Wei Hong
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2019, 29 (01) : 571 - 594
  • [6] Solving the trust-region subproblem using the Lanczos method
    Gould, NIM
    Lucidi, S
    Roma, M
    Toint, PL
    [J]. SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (02) : 504 - 525
  • [7] Convergence of the block Lanczos method for the trust-region subproblem in the hard case
    Feng, Bo
    Wu, Gang
    [J]. NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS, 2024, 31 (05)
  • [8] A multilevel algorithm for solving the trust-region subproblem
    Toint, Philippe L.
    Tomanos, D.
    Weber-Mendonca, M.
    [J]. OPTIMIZATION METHODS & SOFTWARE, 2009, 24 (02): : 299 - 311
  • [9] ON THE GENERALIZED LANCZOS TRUST-REGION METHOD
    Zhang, Lei-Hong
    Shen, Chungen
    Li, Ren-Cang
    [J]. SIAM JOURNAL ON OPTIMIZATION, 2017, 27 (03) : 2110 - 2142
  • [10] Behavior of DCA sequences for solving the trust-region subproblem
    Hoai An Le Thi
    Tao Pham Dinh
    Nguyen Dong Yen
    [J]. Journal of Global Optimization, 2012, 53 : 317 - 329