A fully stochastic primal-dual algorithm
From MaRDI portal
Publication:828693
DOI10.1007/s11590-020-01614-yzbMath1466.90058arXiv1901.08170OpenAlexW3042700844MaRDI QIDQ828693
Adil Salim, Pascal Bianchi, Walid Hachem
Publication date: 5 May 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.08170
Cites Work
- Unnamed Item
- Unnamed Item
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Dynamical behavior of a stochastic forward-backward algorithm using random monotone operators
- Familles d'opérateurs maximaux monotones et mesurabilite
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping. II: Mean-square and linear convergence
- Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Stochastic Approximations and Perturbations in Forward-Backward Splitting for Monotone Operators
- Ergodic Convergence of a Stochastic Proximal Point Algorithm
- A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
- On the interchange of subdifferentiation and conditional expectation for convex functionals
- Variational Analysis
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- A First-Order Stochastic Primal-Dual Algorithm with Correction Step
- On perturbed proximal gradient algorithms
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: A fully stochastic primal-dual algorithm
