Riemannian Preconditioning
DOI10.1137/140970860zbMath1382.65180arXiv1405.6055OpenAlexW3037096902WikidataQ115246982 ScholiaQ115246982MaRDI QIDQ2792408
Bamdev Mishra, Rodolphe J. Sepulchre
Publication date: 9 March 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.6055
Lyapunov equationsequential quadratic programminggeneralized eigenvalue problemRiemannian optimizationlow rankGrassmannquotient manifoldmetric tuning
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55) Real-valued functions on manifolds (58C05)
Related Items (13)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing a differentiable function over a differential manifold
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A Procrustes problem on the Stiefel manifold
- Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries
- Fixed-rank matrix factorizations and Riemannian low-rank optimization
- Two-sided Grassmann-Rayleigh quotient iteration
- A Grassmann--Rayleigh Quotient Iteration for Computing Invariant Subspaces
- Low-Rank Matrix Completion by Riemannian Optimization
- Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: a state of the art survey
- Generalized power method for sparse principal component analysis
- Manopt, a Matlab toolbox for optimization on manifolds
- A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
- Low-Rank Optimization on the Cone of Positive Semidefinite Matrices
- The Geometry of Algorithms with Orthogonality Constraints
- Optimization Techniques on Riemannian Manifolds
- A Cyclic Low-Rank Smith Method for Large Sparse Lyapunov Equations
- Cubically Convergent Iterations for Invariant Subspace Computation
- A Feasible Trust-Region Sequential Quadratic Programming Algorithm
- Low-Rank Solution of Lyapunov Equations
- Means and Averaging in the Group of Rotations
- Matrix Completion From a Few Entries
- Optimization algorithms exploiting unitary constraints
This page was built for publication: Riemannian Preconditioning