New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
From MaRDI portal
Publication:5162590
DOI10.1080/02331934.2020.1761364zbMath1479.90158arXiv1901.08663OpenAlexW3026624575MaRDI QIDQ5162590
Publication date: 3 November 2021
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.08663
linear convergencequadratic growthsublinear convergence ratestochastic proximal pointstochastic alternating projections
Uses Software
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Pegasos: primal estimated sub-gradient solver for SVM
- Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- Convergence of stochastic proximal gradient algorithm
- Linear convergence of first order methods for non-strongly convex optimization
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Fundamentals of Computerized Tomography
- Stochastic First-Order Methods with Random Constraint Projection
- Ergodic Convergence of a Stochastic Proximal Point Algorithm
- An optimal algorithm for stochastic strongly-convex optimization
- Robust Stochastic Approximation Approach to Stochastic Programming
- On the interchange of subdifferentiation and conditional expectation for convex functionals
- Variational Analysis
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Snake: A Stochastic Proximal Gradient Algorithm for Regularized Problems Over Large Graphs
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- Regularized Iterative Stochastic Approximation Methods for Stochastic Variational Inequality Problems
- The method of projections for finding the common point of convex sets
This page was built for publication: New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
