Region-Preserving Accelerated Gradient Methods for Geodesically Convex Optimization
Abstract
Accelerated Riemannian optimization methods often require a priori assumptions that their iterates remain in a region where geometric bounds hold. We develop a parameterized inertial dynamical system and an explicit accelerated gradient method for smooth geodesically convex optimization on Riemannian manifolds with locally bounded sectional curvature. Our setting allows both positive and negative curvature without requiring completeness of the ambient manifold. Starting from a curvature-corrected continuous model, we construct the discrete updates by eliminating indefinite cross terms in the Lyapunov energy difference and derive verifiable conditions for a fixed step size. The resulting energy analysis establishes preservation of the initial geodesic ball without assuming iterate containment in advance. We further establish accelerated convergence rates for both geodesically convex and strongly geodesically convex objectives, without requiring restarts.
Related
- ABrA-GD: Adaptive Bregman Accelerated Gradient Descent for Relatively Smooth and (Strongly-)Convex Optimization
- A unified framework for original energy dissipation of equilibrium-preserving exponential Runge--Kutta methods for L2 gradient flows
- Accelerated Bregman Proximal Gradient Methods from Dual Geometric Perspectives
- Accelerated Proximal Gradient Method for Non-Strongly Convex Time-Varying Optimization
- Accelerated Prox-Level Methods for Unknown Piecewise-Smooth Optimization II: Function-constrained Optimization
BibTeX
@misc{zhou2026regionpreserving,
title = {{Region-Preserving Accelerated Gradient Methods for Geodesically Convex Optimization}},
author = {Derun Zhou},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.41331},
eprint = {2610.41331},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.41331},
}
RIS
TY - UNPB
TI - Region-Preserving Accelerated Gradient Methods for Geodesically Convex Optimization
AU - Derun Zhou
PY - 2026
DA - 2026/10/30
PB - arXiv
DO - 10.48550/arxiv.2610.41331
UR - https://arxiv.org/abs/2610.41331
AB - Accelerated Riemannian optimization methods often require a priori assumptions that their iterates remain in a region where geometric bounds hold. We develop a parameterized inertial dynamical system and an explicit accelerated gradient method for smooth geodesically convex optimization on Riemannian manifolds with locally bounded sectional curvature. Our setting allows both positive and negative curvature without requiring completeness of the ambient manifold. Starting from a curvature-corrected continuous model, we construct the discrete updates by eliminating indefinite cross terms in the Lyapunov energy difference and derive verifiable conditions for a fixed step size. The resulting energy analysis establishes preservation of the initial geodesic ball without assuming iterate containment in advance. We further establish accelerated convergence rates for both geodesically convex and strongly geodesically convex objectives, without requiring restarts.
ER -