Stochastic proximal splitting algorithm for composite minimization
From MaRDI portal
Abstract: Supported by the recent contributions in multiple branches, the first-order splitting algorithms became central for structured nonsmooth optimization. In the large-scale or noisy contexts, when only stochastic information on the smooth part of the objective function is available, the extension of proximal gradient schemes to stochastic oracles is based on proximal tractability of the nonsmooth component and it has been deeply analyzed in the literature. However, there remained gaps illustrated by composite models where the nonsmooth term is not proximally tractable anymore. In this note we tackle composite optimization problems, where the access only to stochastic information on both smooth and nonsmooth components is assumed, using a stochastic proximal first-order scheme with stochastic proximal updates. We provide the iteration complexity (in expectation of squared distance to the optimal set) under the strong convexity assumption on the objective function. Empirical behavior is illustrated by numerical tests on parametric sparse representation models.
Recommendations
- Inexact proximal stochastic gradient method for convex composite optimization
- A proximal method for composite minimization
- A stochastic Bregman primal-dual splitting algorithm for composite optimization
- Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
- Stochastic proximal quasi-Newton methods for non-convex composite optimization
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Stochastic proximal linear method for structured non-convex problems
- Stochastic proximal methods for non-smooth non-convex constrained sparse optimization
- Stochastic Methods for Composite and Weakly Convex Optimization Problems
- On stochastic primal-dual hybrid gradient approach for compositely regularized minimization
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Proximal Gradient Algorithm for Decentralized Composite Optimization
- Accelerating the convergence of the method of alternating projections
- Convergence of stochastic proximal gradient algorithm
- Ergodic convergence of a stochastic proximal point algorithm
- Gradient methods for minimizing composite functions
- Inexact proximal stochastic gradient method for convex composite optimization
- Introductory lectures on convex optimization. A basic course.
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- On the interchange of subdifferentiation and conditional expectation for convex functionals
- Pegasos: primal estimated sub-gradient solver for SVM
- Random algorithms for convex minimization problems
- Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems
- Robust Stochastic Approximation Approach to Stochastic Programming
- Snake: A Stochastic Proximal Gradient Algorithm for Regularized Problems Over Large Graphs
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Stochastic first-order methods with random constraint projection
- Stochastic model-based minimization of weakly convex functions
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Variational Analysis
Cited in
(6)- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Sub-linear convergence of a stochastic proximal iteration method in Hilbert space
- Inexact proximal stochastic gradient method for convex composite optimization
- scientific article; zbMATH DE number 7255141 (Why is no real title available?)
- Sublinear convergence of a tamed stochastic gradient descent method in Hilbert space
This page was built for publication: Stochastic proximal splitting algorithm for composite minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2047212)
