Stochastic Approximations and Perturbations in Forward-Backward Splitting for Monotone Operators
arXiv:1507.07095
Abstract
We investigate the asymptotic behavior of a stochastic version of the forward-backward splitting algorithm for finding a zero of the sum of a maximally monotone set-valued operator and a cocoercive operator in Hilbert spaces. Our general setting features stochastic approximations of the cocoercive operator and stochastic perturbations in the evaluation of the resolvents of the set-valued operator. In addition, relaxations and not necessarily vanishing proximal parameters are allowed. Weak and strong almost sure convergence properties of the iterates is established under mild conditions on the underlying stochastic processes. Leveraging these results, we also establish the almost sure convergence of the iterates of a stochastic variant of a primal-dual proximal splitting method for composite minimization problems.
References in corpus (2)
Cited by in corpus (6)
- Fixed Point Strategies in Data Science
- Learning Sparse Low-Precision Neural Networks With Learnable Regularization
- A Random Block-Coordinate Douglas-Rachford Splitting Method with Low Computational Complexity for Binary Logistic Regression
- A Primal-Dual Algorithm for Link Dependent Origin Destination Matrix Estimation
- String-Averaging Incremental Subgradients for Constrained Convex Optimization with Applications to Reconstruction of Tomographic Images
- The Stochastic Fejér-Monotone Hybrid Steepest Descent Method and the Hierarchical RLS