Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
DOI10.1007/s10589-023-00489-wzbMath1522.90106arXiv2201.05498MaRDI QIDQ6166657
Cheik Traoré, Silvia Villa, Saverio Salzo
Publication date: 3 August 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.05498
convergence ratesconvex optimizationerror boundsforward-backward algorithmrandomized block-coordinate descentasynchronous algorithmsstochastic quasi-Fejér sequences
Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Decomposition methods (49M27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Gradient methods for minimizing composite functions
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Introductory lectures on convex optimization. A basic course.
- On unbounded delays in asynchronous parallel fixed-point algorithms
- From error bounds to the complexity of first-order descent methods for convex functions
- Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis
- Asynchronous parallel algorithms for nonconvex optimization
- Pivotal estimation via square-root lasso in nonparametric regression
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Chaotic relaxation
- Atomic Decomposition by Basis Pursuit
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- Sparse Matrix Inversion with Scaled Lasso
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- Revisiting Asynchronous Linear Solvers
- Just relax: convex programming methods for identifying sparse signals in noise
- Probability
- On Distributed Nonconvex Optimization: Projected Subgradient Method for Weakly Convex Problems in Networks
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Signal Recovery by Proximal Forward-Backward Splitting
- Understanding Machine Learning
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- Compressed sensing
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization
