A Stochastic Proximal-Gradient Method for Regularized Generally Constrained Continuous Optimization
It is proved under reasonable assumptions that the stochastic proximal-gradient method reaches an $\epsilon$-KKT point within $O(\epsilon^{-2})$ iterations with high probability and implies almost-sure termination in finitely many iterations and an $O(\epsilon^{-2})$ bound on the expected iteration complexity.