The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem
From MaRDI portal
Publication:5857292
DOI10.1137/19M1279691zbMath1462.90083arXiv1908.02094OpenAlexW3137421758MaRDI QIDQ5857292
Publication date: 31 March 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.02094
eigenvalue problemChebyshev polynomiala priori boundtrust-region subproblemsymmetric Lanczos processhard caseeasy caseGLTR method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10)
Related Items (3)
Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem ⋮ Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization ⋮ A Block Lanczos Method for Large-Scale Quadratic Minimization Problems with Orthogonality Constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Error bounds of Lanczos approach for trust-region subproblem
- On solving trust-region and other regularised subproblems in optimization
- On Lagrange multipliers of trust-region subproblems
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- A constrained eigenvalue problem
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- On the truncated conjugate gradient method
- On the convergence of Ritz pairs and refined Ritz vectors for quadratic eigenvalue problems
- A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem
- Minimizing a Quadratic Over a Sphere
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Numerical Methods for Large Eigenvalue Problems
- Minimization of a Large-Scale Quadratic FunctionSubject to a Spherical Constraint
- Computing a Trust Region Step
- Algorithm 873
- Iterative Methods for Finding a Trust-region Step
- A Subspace Minimization Method for the Trust-Region Step
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Trust Region Methods
- The trust region subproblem and semidefinite programming*
- Graph Partitioning and Continuous Quadratic Programming
- Solving the Trust-Region Subproblem using the Lanczos Method
- The Convergence of Generalized Lanczos Methods for Large Unsymmetric Eigenproblems
- On the Generalized Lanczos Trust-Region Method
- Functions of Matrices
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- The Lanczos and Conjugate Gradient Algorithms
This page was built for publication: The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem