Solving trust region subproblems using Riemannian optimization
From MaRDI portal
Publication:6109916
DOI10.1007/s00211-023-01360-0arXiv2010.07547OpenAlexW3092866758MaRDI QIDQ6109916
Uria Mor, Boris Shustin, Haim Avron
Publication date: 4 July 2023
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.07547
Numerical linear algebra (65F99) Mathematical programming (90C99) Acceleration of convergence in numerical analysis (65B99)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A constrained eigenvalue problem
- Quadratically constrained least squares and quadratic problems
- Minimizing a Quadratic Over a Sphere
- Riemannian Preconditioning
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
- Computing a Trust Region Step
- The Geometry of Algorithms with Orthogonality Constraints
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- On Some Properties of Quadratic Programs with a Convex Quadratic Constraint
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
- Practical Sketching Algorithms for Low-Rank Matrix Approximation
- Solving the Trust-Region Subproblem using the Lanczos Method
- An Introduction to Optimization on Smooth Manifolds
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- Approximating Spectral Sums of Large-Scale Matrices using Stochastic Chebyshev Approximations
