Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
From MaRDI portal
Publication:5210741
DOI10.1080/10556788.2019.1670177zbMath1428.90160OpenAlexW2979984930WikidataQ127064422 ScholiaQ127064422MaRDI QIDQ5210741
Nicholas I. M. Gould, Valeria Simoncini
Publication date: 21 January 2020
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/42012632
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Quadratic programming (90C20)
Related Items (8)
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 ⋮ On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces ⋮ Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem ⋮ Adaptive regularization with cubics on manifolds ⋮ Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization ⋮ Solving the Cubic Regularization Model by a Nested Restarting Lanczos Method ⋮ \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for trust region problems
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- On solving trust-region and other regularised subproblems in optimization
- On Lagrange multipliers of trust-region subproblems
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Cubic regularization of Newton method and its global performance
- Reaching the superlinear convergence phase of the CG method
- On the use of iterative methods in cubic regularization for unconstrained optimization
- 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
- Accelerating the LSTRS Algorithm
- A Nested Lanczos Method for the Trust-Region Subproblem
- 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
- Decay Rates for Inverses of Band Matrices
- Computing Optimal Locally Constrained Steps
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Trust Region Methods
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
- Complexity Analysis of Second-Order Line-Search Algorithms for Smooth Nonconvex Optimization
- The trust region subproblem and semidefinite programming*
- Solving the Trust-Region Subproblem using the Lanczos Method
- Iterative Krylov Methods for Large Linear Systems
- Iterative Solution Methods
- Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- On the Generalized Lanczos Trust-Region Method
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- On the sublinear and superlinear rate of convergence of conjugate gradient methods
This page was built for publication: Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
