Metraipolis › archive › dc_b1a3df7ec302

Open-Loop Riemannian Frank--Wolfe: Fast Rates under Error Bounds and Scaling Inequalities — arXiv:2608.21598

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.21598
License (as archived)
CC0-1.0
Archived
2026-10-18T08:25:31.912Z
SHA-256 of the archived text
a6d91471814cdb2b003e946a893f38779984d7f6ed5bbfaa4e61cad5f787043f
Stable URL of this page
https://metraipolis.com/documento/dc_b1a3df7ec302

How to cite

Open-Loop Riemannian Frank--Wolfe: Fast Rates under Error Bounds and Scaling Inequalities — arXiv:2608.21598 — arXiv (en), https://arxiv.org/abs/2608.21598 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b1a3df7ec302 (Metraipolis archive dc_b1a3df7ec302, sha256 a6d91471814cdb2b003e946a893f38779984d7f6ed5bbfaa4e61cad5f787043f)
BibTeX
@misc{dcb1a3df7ec302,
  title = {Open-Loop Riemannian Frank--Wolfe: Fast Rates under Error Bounds and Scaling Inequalities — arXiv:2608.21598},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.21598},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b1a3df7ec302; sha256 a6d91471814cdb2b003e946a893f38779984d7f6ed5bbfaa4e61cad5f787043f},
  year = {2026}
}

Archived text

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

We explore fast convergence of the Riemannian Frank--Wolfe method for smooth geodesically convex optimization over compact feasible sets. Hadamard manifolds are the main setting. On general complete manifolds, the analysis accounts for all feasible minimizing geodesics. We consider the open loop step-size $\eta_k=a/(k+a)$, which only uses the iteration index. Under a local Hölderian error bound and local length-normalized directional scaling, every $a>2$ gives the eventual rate $O(k^{-1/(1-\theta)})$ for $\theta\in(0,1/2]$. An interior-ball condition yields $O(k^{-2})$ for strongly geodesically convex objectives. Under an exact Riemannian scaling inequality and a uniform positive lower bound on the gradient norm, every $a\geq2$ gives $O(k^{-a})$ after an explicit threshold index. The same rate holds for the smallest Frank--Wolfe gap over the most recent half of the iterates. For geodesic balls of radius \(R<\pi/2\) in the unit sphere, we establish the scaling inequality with $\alpha_R=\tfrac12\cot R$, yielding $O(k^{-a})$ primal error and recent-window gap rates. We also analyze the standard gap-feedback short step under the local error-bound conditions, obtaining $O(k^{-1/(1-2\theta)})$ for $\theta<1/2$ and a linear rate for $\theta=1/2$. Numerical experiments illustrate the predicted rates and compare iteration-only and feedback-based step selection.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-25 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.21598 — 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-18T08:18:05.681Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).