On unbounded delays in asynchronous parallel fixed-point algorithms
From MaRDI portal
Publication:1668724
DOI10.1007/s10915-017-0628-zzbMath1415.65138arXiv1609.04746OpenAlexW2963489801MaRDI QIDQ1668724
Publication date: 29 August 2018
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.04746
Numerical mathematical programming methods (65K05) Convex programming (90C25) Parallel numerical computation (65Y05)
Related Items
Block delayed Majorize-Minimize subspace algorithm for large scale image restoration *, On the convergence of asynchronous parallel iteration with unbounded delays, Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems, Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization, A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm, Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems
Uses Software
Cites Work
- Unnamed Item
- A three-operator splitting scheme and its optimization applications
- Coordinate-friendly structures, algorithms and applications
- Chaotic relaxation
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- Vector-valued Laplace Transforms and Cauchy Problems
- Revisiting Asynchronous Linear Solvers
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems
- Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- Convex analysis and monotone operator theory in Hilbert spaces
