Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters
From MaRDI portal
Publication:4558160
zbMath1455.90138arXiv1704.03540MaRDI QIDQ4558160
No author found.
Publication date: 21 November 2018
Full work available at URL: https://arxiv.org/abs/1704.03540
Computational learning theory (68Q32) Nonlinear programming (90C30) Convergence and divergence of series and sequences (40A05) Parallel algorithms in computer science (68W10) Distributed systems (68M14)
Related Items (4)
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays ⋮ Composite optimization with coupling constraints via dual proximal gradient method with applications to asynchronous networks ⋮ An accelerated proximal algorithm for regularized nonconvex and nonsmooth bi-level optimization ⋮ Sharper Bounds for Proximal Gradient Algorithms with Errors
This page was built for publication: Distributed Proximal Gradient Algorithm for Partially Asynchronous Computer Clusters