Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
From MaRDI portal
Recommendations
Cites work
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- A linear-time algorithm for trust region problems
- A Nested Lanczos Method for the Trust-Region Subproblem
- A new matrix-free algorithm for the large-scale trust-region subproblem
- A second-order cone based approach for solving the trust-region subproblem and its variants
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- A Subspace Minimization Method for the Trust-Region Step
- Accelerating the LSTRS algorithm
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- Algorithm 873
- Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization
- Computing a Trust Region Step
- Computing Optimal Locally Constrained Steps
- Cubic regularization of Newton method and its global performance
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Decay Rates for Inverses of Band Matrices
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Globally solving the trust region subproblem using simple first-order methods
- Gradient descent finds the cubic-regularized nonconvex Newton step
- scientific article; zbMATH DE number 3725604 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Iterative Krylov Methods for Large Linear Systems
- Iterative methods for finding a trust-region step
- Iterative Solution Methods
- Krylov subspace methods. Principles and analysis.
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Minimizing a quadratic over a sphere
- On Lagrange multipliers of trust-region subproblems
- On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces
- On solving trust-region and other regularised subproblems in optimization
- On the generalized Lanczos trust-region method
- On the sublinear and superlinear rate of convergence of conjugate gradient methods
- On the use of iterative methods in cubic regularization for unconstrained optimization
- Reaching the superlinear convergence phase of the CG method
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Solving the Trust-Region Subproblem using the Lanczos Method
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The trust region subproblem and semidefinite programming*
- Trust Region Methods
Cited in
(16)- Adaptive regularization with cubics on manifolds
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm
- Refined bounds on the convergence of block Lanczos method for extended trust-region subproblem
- On monotonic estimates of the norm of the minimizers of regularized quadratic functions in Krylov spaces
- A regularized method for solving variational and quasivariational inequalities involving errors
- On the accuracy of regularized solutions to quadratic minimization problems on a half space, in case of a normally solvable operator
- Optimal bounds for round-off errors in the cyclic peaceman-rachford iteration
- Solving Large-Scale Cubic Regularization by a Generalized Eigenvalue Problem
- Trust-region Newton-CG with strong second-order complexity guarantees for nonconvex optimization
- Solving the cubic regularization model by a nested restarting Lanczos method
- Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization
- A Riemannian dimension-reduced second-order method with application in sensor network localization
- Scalable adaptive cubic regularization methods
- On convergence of the generalized Lanczos trust-region method for trust-region subproblems
- Regularized methods via cubic model subspace minimization for nonconvex optimization
- Complexity of minimizing regularized convex quadratic functions
This page was built for publication: Error estimates for iterative algorithms for minimizing regularized quadratic subproblems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210741)
