A Geometric Framework for Stochastic Iterations
Optimization and Control
2026-02-17 v3 Probability
Abstract
This paper concerns models and convergence principles for dealing with stochasticity in a wide range of algorithms arising in nonlinear analysis and optimization in Hilbert spaces. It proposes a flexible geometric framework within which existing solution methods can be recast and improved, and new ones can be designed. Almost sure weak, strong, and linear convergence results are established in particular for stochastic fixed point iterations, the stochastic gradient descent method, and stochastic extrapolated parallel algorithms for feasibility problems. In these areas, the proposed algorithms exceed the features and convergence guarantees of the state of the art. Numerical applications to signal and image recovery are provided.
Cite
@article{arxiv.2504.02761,
title = {A Geometric Framework for Stochastic Iterations},
author = {Patrick L. Combettes and Javier I. Madariaga},
journal= {arXiv preprint arXiv:2504.02761},
year = {2026}
}