mlsanityData to 7 Oct 2026

Convergence of Stochastic Proximal Gradient Algorithm

arXiv 1403.5074 ↗First posted 20 Mar 2014math.OCcited by 17

Not on the map. Why?

Abstract (arXiv)

We prove novel convergence results for a stochastic proximal gradient algorithm suitable for solving a large class of convex optimization problems, where a convex objective function is given by the sum of a smooth and a possibly non-smooth component. We consider the iterates convergence and derive O(1/n) non asymptotic bounds in expectation in the strongly convex case, as well as almost sure convergence results under weaker assumptions. Our approach allows to avoid averaging and weaken boundedness assumptions which are often considered in theoretical studies and might not be satisfied in practice.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Mar 2014.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 2; 2022: 5; 2023: 3; 2024: 5; 2025: 0; 2026: 2.

17 papers.

Sort: