Asynchronous parallel algorithms for nonconvex optimization
From MaRDI portal
Publication:2205974
DOI10.1007/s10107-019-01408-wzbMath1451.90151arXiv1607.04818OpenAlexW2962760808WikidataQ127650511 ScholiaQ127650511MaRDI QIDQ2205974
Loris Cannelli, Gesualdo Scutari, Vyacheslav Kungurtsev, Francisco Facchinei
Publication date: 21 October 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04818
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Parallel algorithms in computer science (68W10)
Related Items
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays ⋮ The last dozen of years of or research in Czechia and Slovakia ⋮ Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks ⋮ On the convergence of asynchronous parallel iteration with unbounded delays ⋮ Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization ⋮ Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ An Optimal Algorithm for Decentralized Finite-Sum Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On asynchronous iterations
- Coordinate descent algorithms
- On the convergence of asynchronous parallel iteration with unbounded delays
- Probability theory. A comprehensive course.
- Chaotic relaxation
- ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
- Distributed asynchronous deterministic and stochastic gradient optimization algorithms
- On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm
- Asynchronous Iterative Methods for Multiprocessors
- Decomposition by Partial Linearization: Parallel Optimization of Multi-Agent Systems
- Parallel Selective Algorithms for Nonconvex Big Data Optimization
- Hybrid Random/Deterministic Parallel Algorithms for Convex and Nonconvex Big Data Optimization
- Perturbed Iterate Analysis for Asynchronous Stochastic Optimization
- Parallel and Distributed Methods for Constrained Nonconvex Optimization—Part I: Theory
- Parallel and Distributed Methods for Constrained Nonconvex Optimization-Part II: Applications in Communications and Machine Learning
- A Distributed, Asynchronous, and Incremental Algorithm for Nonconvex Optimization: An ADMM Approach
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- Probability