Retraction-Based Gradient Projection Algorithms on Manifolds
Not on the map. Why?
Abstract (arXiv)
We introduce a framework for retraction-based convex optimization on Riemannian manifolds, which includes a notion of retraction-specific convex sets and retraction-based gradient projection algorithms. The standard theory of gradient projection algorithms generalizes easily to this framework. Within this framework, we establish convergence results for retraction-based gradient projection algorithms with various stepsize rules. As an application, we use our framework to study the weighted low-rank approximation. We also provide numerical validation of our convergence results on the image completion task.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 61 references that are in the map. First posted on arXiv 25 Sep 2026.
Builds on
20 of 61 references.
References · 20
- 2018Riemannian Adaptive Optimization Methodscited by 194
- 2018Stochastic model-based minimization of weakly convex functionscited by 159
- 2013Mini-batch Stochastic Approximation Methods for Nonconvex Stochastic Composite Optimizationcited by 143
- 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
- 2020Efficient Riemannian Optimization on the Stiefel Manifold via the Cayley Transformcited by 80
- 2017Riemannian Optimization via Frank-Wolfe Methodscited by 21
- 2013A Framework of Constraint Preserving Update Schemes for Optimization on Stiefel Manifoldcited by 13
- 2018Geodesic Convex Optimization: Differentiation on Manifolds, Geodesics, and Convexitycited by 13
- 2024Fisher-Rao Gradient Flow: Geodesic Convexity and Functional Inequalitiescited by 13
- 2013R3MC: A Riemannian three-factor algorithm for low-rank matrix completioncited by 11
- 2019Regularized Weighted Low Rank Approximationcited by 10
- 2020Global Riemannian Acceleration in Hyperbolic and Spherical Spacescited by 10
8 more
- 2015Matrix Completion Under Monotonic Single Index Modelscited by 8
- 2022Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Datacited by 7
- 2021Matrix Completion with Model-free Weightingcited by 6
- 2025Implicit Riemannian Optimism with Applications to Min-Max Problemscited by 4
- 2020Median Matrix Completion: from Embarrassment to Optimalitycited by 1
- 2024Computing Augustin Information via Hybrid Geodesically Convex Optimizationcited by 1
- 2024Structured Regularization for Constrained Optimization on the SPD Manifoldcited by 1
- 2025Weighted Low-rank Approximation via Stochastic Gradient Descent on Manifoldscited by 1
Built on by
Not cited yet.