A Riemannian subspace limited-memory SR1 trust region method
From MaRDI portal
Publication:518140
DOI10.1007/S11590-015-0977-1zbMath1364.90319OpenAlexW2286888015WikidataQ115377845 ScholiaQ115377845MaRDI QIDQ518140
Publication date: 28 March 2017
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0977-1
Related Items (4)
A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization ⋮ A trust region method for solving multicriteria optimization problems on Riemannian manifolds ⋮ A Riemannian subspace BFGS trust region method ⋮ A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Optimization algorithms on the Grassmann manifold with application to matrix eigenvalue problems
- A truncated-CG style method for symmetric generalized eigenvalue problems
- Approximate solution of the trust region problem by minimization over two-dimensional subspaces
- Representations of quasi-Newton matrices and their use in limited memory methods
- Trust-region methods on Riemannian manifolds
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization
- Reduced-Hessian Quasi-Newton Methods for Unconstrained Optimization
- Low-Rank Matrix Completion by Riemannian Optimization
- Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
- Manopt, a Matlab toolbox for optimization on manifolds
- An implicit trust-region method on Riemannian manifolds
- Accelerated Line-search and Trust-region Methods
- A Subspace Minimization Method for the Trust-Region Step
- A Subspace Study on Conjugate Gradient Algorithms
This page was built for publication: A Riemannian subspace limited-memory SR1 trust region method
