EUVIMEDEUVIMED entdecken
Crossref

Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces

Ariel Goodwin, Adrian S. Lewis, Genaro López-Acedo, Adriana Nicolae

Mathematical Programming · 04.03.2026

DOI: 10.1007/s10107-026-02334-4 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Programming, online erschienen am 04.03.2026. Verfasst von Ariel Goodwin und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 43 Literaturangaben. Gefördert von: National Science Foundation, Dirección General de Enseñanza Superior e Investigación Científica, CNCS/CCCDI - UEFISCDI.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

As a foundation for optimization, convexity is useful beyond the classical settings of Euclidean and Hilbert space. The broader arena of nonpositively curved metric spaces, which includes manifolds like hyperbolic space, as well as metric trees and more general CAT(0) cubical complexes, supports primal tools like proximal operations for geodesically convex functions. However, the lack of linear structure in such spaces complicates dual constructions like subgradients. To address this hurdle, we introduce a new type of subgradient for functions on Hadamard spaces, based on Busemann functions. Our notion supports generalizations of classical stochastic and incremental subgradient methods, with guaranteed complexity bounds. We illustrate with subgradient algorithms for $p$-mean problems in general Hadamard spaces, in particular computing medians in BHV tree space.

Förderung

  • National Science Foundation
  • Dirección General de Enseñanza Superior e Investigación Científica
  • CNCS/CCCDI - UEFISCDI

Zitieren

APA

Goodwin, A., Lewis, A. S., López-Acedo, G., & Nicolae, A. (2026). Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces. Mathematical Programming. https://doi.org/10.1007/s10107-026-02334-4

Vancouver

Goodwin A, Lewis AS, López-Acedo G, Nicolae A. Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces. Mathematical Programming. 2026. doi:10.1007/s10107-026-02334-4

BibTeX
@article{Goodwin2026,
  author = {Goodwin, Ariel and Lewis, Adrian S. and López-Acedo, Genaro and Nicolae, Adriana},
  title = {Stochastic and incremental subgradient methods for convex optimization on Hadamard spaces},
  journal = {Mathematical Programming},
  year = {2026},
  doi = {10.1007/s10107-026-02334-4}
}
Kostenlos starten →