Metraipolis › archive › dc_7dd2a06992e5

Region-Preserving Accelerated Gradient Methods for Geodesically Convex Optimization — arXiv:2610.41331

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41331
License (as archived)
CC0-1.0
Archived
2026-11-03T08:15:53.524Z
SHA-256 of the archived text
833f0a68a294675095fd46472efcb441ff6c5ad31176dc5951780e408a5b09c7
Stable URL of this page
https://metraipolis.com/documento/dc_7dd2a06992e5

How to cite

Region-Preserving Accelerated Gradient Methods for Geodesically Convex Optimization — arXiv:2610.41331 — arXiv (en), https://arxiv.org/abs/2610.41331 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7dd2a06992e5 (Metraipolis archive dc_7dd2a06992e5, sha256 833f0a68a294675095fd46472efcb441ff6c5ad31176dc5951780e408a5b09c7)
BibTeX
@misc{dc7dd2a06992e5,
  title = {Region-Preserving Accelerated Gradient Methods for Geodesically Convex Optimization — arXiv:2610.41331},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41331},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7dd2a06992e5; sha256 833f0a68a294675095fd46472efcb441ff6c5ad31176dc5951780e408a5b09c7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41331. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2610.41331 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:04:23.895Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).