ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates

From MaRDI portal
Publication:2821779


DOI10.1137/15M1024950zbMath1350.49041arXiv1506.02396MaRDI QIDQ2821779

Zhimin Peng, Ming Yan, Wotao Yin, Yang-yang Xu

Publication date: 23 September 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.02396


65K05: Numerical mathematical programming methods

90C25: Convex programming

90C26: Nonconvex programming, global optimization

90C30: Nonlinear programming

65K10: Numerical optimization and variational techniques

49M05: Numerical methods based on necessary conditions

47J25: Iterative procedures involving nonlinear operators

49M37: Numerical methods based on nonlinear programming

47H10: Fixed-point theorems

93A14: Decentralized systems

47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.

65B99: Acceleration of convergence in numerical analysis


Related Items

Perturbed Iterate Analysis for Asynchronous Stochastic Optimization, Hybrid Jacobian and Gauss--Seidel Proximal Block Coordinate Update Methods for Linearly Constrained Convex Programming, Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting, Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm, Distributed Learning with Sparse Communications by Identification, Asynchronous Optimization over Weakly Coupled Renewal Systems, Scalable Asynchronous Domain Decomposition Solvers, A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm, Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints, Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications, Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning, ARock, Randomized progressive hedging methods for multi-stage stochastic programming, On unbounded delays in asynchronous parallel fixed-point algorithms, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, Global convergence of ADMM in nonconvex nonsmooth optimization, Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization, Proximal primal-dual best approximation algorithm with memory, An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games, A stochastic subspace approach to gradient-free optimization in high dimensions, Risk-averse stochastic programming and distributionally robust optimization via operator splitting, Asynchronous parallel algorithms for nonconvex optimization, Asynchronous level bundle methods, Asynchronous distributed voltage control in active distribution networks, Primal-dual block-proximal splitting for a class of non-convex problems, Partition-based multi-agent optimization in the presence of lossy and asynchronous communication, Markov chain block coordinate descent, An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization, Block-proximal methods with spatially adapted acceleration, 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


Uses Software


Cites Work