On Busemann subgradient methods for stochastic minimization in Hadamard spaces
math.OC
Submitted: 2026-02-08
Updated: 2026-11-16
Terminology
Sources
- Horospherically Convex Optimization on Hadamard Manifolds Part I: Analysis and Algorithms
- Horoballs and the subgradient method
- An abstract effective convergence theorem for stochastic processes, with applications to stochastic approximation
- Mean-square and sublinear convergence of a stochastic proximal point algorithm in metric spaces of nonpositive curvature
- Strong laws, random monotone vector fields and gradient flows on metric spaces of nonpositive curvature
- Weak convergence of the stochastic proximal point method in metric spaces
- Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise