The orthogonal Procrustes problem satisfies weak-quasi-strong-convexity, yielding linear convergence of Riemannian gradient descent for invertible matrices and O(1/t) function-value convergence for singular ones.
Optimization algo- rithms on matrix manifolds
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.NA 1years
2024 1verdicts
ACCEPT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
A geodesic convexity-like structure for the polar decomposition of a square matrix
The orthogonal Procrustes problem satisfies weak-quasi-strong-convexity, yielding linear convergence of Riemannian gradient descent for invertible matrices and O(1/t) function-value convergence for singular ones.