Global Riemannian Acceleration in Hyperbolic and Spherical Spaces
Not on the map. Why?
Abstract (arXiv)
We further research on the accelerated optimization phenomenon on Riemannian manifolds by introducing accelerated global first-order methods for the optimization of L-smooth and geodesically convex (g-convex) or μ-strongly g-convex functions defined on the hyperbolic space or a subset of the sphere. For a manifold other than the Euclidean space, these are the first methods to globally achieve the same rates as accelerated gradient descent in the Euclidean space with respect to L and ε (and μ if it applies), up to log factors. Due to the geometric deformations, our rates have an extra factor, depending on the initial distance R to a minimizer and the curvature K, with respect to Euclidean accelerated algorithms As a proxy for our solution, we solve a constrained non-convex Euclidean problem, under a condition between convexity and quasar-convexity, of independent interest. Additionally, for any Riemannian manifold of bounded sectional curvature, we provide reductions from optimization methods for smooth and g-convex functions to methods for smooth and strongly g-convex functions and vice versa. We also reduce global optimization to optimization over bounded balls where the effect of the curvature is reduced.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Dec 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 3; 2023: 1; 2024: 2; 2025: 2; 2026: 2.
10 papers.
- 2022Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithmcited by 9
- 2023Minimizing Dynamic Regret on Geodesic Metric Spacescited by 6
- 2022Riemannian accelerated gradient methods via extrapolationcited by 5
- 2022Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penaltiescited by 4
- 2024Non-Euclidean High-Order Smooth Convex Optimizationcited by 3
- 2024Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reductioncited by 1
- 2025Smooth Quasar-Convex Optimization with Constraintscited by 1
- 2025Finite-Time Analysis of Stochastic Nonconvex Nonsmooth Optimization on the Riemannian Manifoldscited by 1
- 2026Decentralized Online Riemannian Optimization for Strongly Geodesically Convex Functionscited by 1
- 2026Retraction-Based Gradient Projection Algorithms on Manifoldscited by 0
- 2026Retraction-Based Gradient Projection Algorithms on Manifolds25 Sep 2026
- 2026Decentralized Online Riemannian Optimization for Strongly Geodesically Convex Functions22 Jul 2026
- 2025Finite-Time Analysis of Stochastic Nonconvex Nonsmooth Optimization on the Riemannian Manifolds24 Oct 2025
- 2025Smooth Quasar-Convex Optimization with Constraints2 Oct 2025
- 2024Non-Euclidean High-Order Smooth Convex Optimization13 Nov 2024
- 2024Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction11 Mar 2024
- 2023Minimizing Dynamic Regret on Geodesic Metric Spaces17 Feb 2023
- 2022Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties26 Nov 2022
- 2022Riemannian accelerated gradient methods via extrapolation13 Aug 2022
- 2022Sion's Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm13 Feb 2022