Metraipolis › archive › dc_bfebd8fc9a07
Projected Gradient Method on Hadamard Manifolds — arXiv:2609.00540
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.00540
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T07:01:22.626Z
- SHA-256 of the archived text
f28b5c2765ebb7f1f7d149e5717101e047a925658937be8822d6d800365fdf07- Stable URL of this page
https://metraipolis.com/documento/dc_bfebd8fc9a07
How to cite
Projected Gradient Method on Hadamard Manifolds — arXiv:2609.00540 — arXiv (en), https://arxiv.org/abs/2609.00540 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bfebd8fc9a07 (Metraipolis archive dc_bfebd8fc9a07, sha256 f28b5c2765ebb7f1f7d149e5717101e047a925658937be8822d6d800365fdf07)
BibTeX
@misc{dcbfebd8fc9a07,
title = {Projected Gradient Method on Hadamard Manifolds — arXiv:2609.00540},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.00540},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bfebd8fc9a07; sha256 f28b5c2765ebb7f1f7d149e5717101e047a925658937be8822d6d800365fdf07},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.00540. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study constrained smooth optimization problems on Hadamard manifolds with closed geodesically convex feasible sets. We analyze two projected gradient schemes: one with a constant stepsize and another with a backtracking line search. The constant-stepsize scheme is analyzed under the assumption that the objective function has a Lipschitz continuous Riemannian gradient, whereas the backtracking variant does not require this assumption to establish stationarity of accumulation points. For both schemes, we prove that every accumulation point of the generated sequence is first-order stationary under the respective assumptions, without requiring compactness of the feasible set; compactness is needed only to ensure the existence of accumulation points. When the objective function has a Lipschitz continuous Riemannian gradient, we derive iteration-complexity bounds of order \(O(1/\sqrt{N})\) for projection-based stationarity measures for both schemes, together with the corresponding \(\varepsilon\)-complexity estimates. For the backtracking scheme, the complexity analysis additionally requires the trial line-search stepsizes to be uniformly bounded away from zero. Under the same respective assumptions, the generated sequences are also asymptotically regular. Finally, we illustrate the practical performance of the methods by solving constrained Karcher mean problems on the manifold of symmetric positive definite matrices.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.00540 — 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-10-17T06:49:55.520Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).