pith. sign in

arxiv: 1405.6055 · v3 · pith:IOIWQ5DGnew · submitted 2014-05-23 · 🧮 math.OC

Riemannian preconditioning

classification 🧮 math.OC
keywords riemannianoptimizationquadraticaddressapplicationsbasicconnectionconstraints
0
0 comments X
read the original abstract

This paper exploits a basic connection between sequential quadratic programming and Riemannian gradient optimization to address the general question of selecting a metric in Riemannian optimization, in particular when the Riemannian structure is sought on a quotient manifold. The proposed method is shown to be particularly insightful and efficient in quadratic optimization with orthogonality and/or rank constraints, which covers most current applications of Riemannian optimization in matrix manifolds.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.