ARock

swMATH16800MaRDI QIDQ28664FDOQ28664

Author name not available (Why is that?)

Described by source

• ARock: an algorithmic framework for asynchronous parallel coordinate updates

Cited In (37)

• Asynchronous distributed voltage control in active distribution networks
• An inertial parallel and asynchronous forward-backward iteration for distributed convex optimization
• Distributed Learning with Sparse Communications by Identification
• Scalable asynchronous domain decomposition solvers
• Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
• Randomized progressive hedging methods for multi-stage stochastic programming
• Primal-dual block-proximal splitting for a class of non-convex problems
• Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
• An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games
• Hybrid Jacobian and Gauss-Seidel proximal block coordinate update methods for linearly constrained convex programming
• On unbounded delays in asynchronous parallel fixed-point algorithms
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Accelerated primal-dual proximal block coordinate updating methods for constrained convex optimization
• A distributed flexible delay-tolerant proximal gradient algorithm
• Proximal primal-dual best approximation algorithm with memory
• Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
• Asynchronous parallel algorithms for nonconvex optimization
• Risk-averse stochastic programming and distributionally robust optimization via operator splitting
• Partition-based multi-agent optimization in the presence of lossy and asynchronous communication
• Block-proximal methods with spatially adapted acceleration
• On the convergence of asynchronous parallel iteration with unbounded delays
• Asynchronous optimization over weakly coupled renewal systems
• A novel bound on the convergence rate of ADMM for distributed optimization
• Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
• A stochastic subspace approach to gradient-free optimization in high dimensions
• Perturbed iterate analysis for asynchronous stochastic optimization
• Redundancy techniques for straggler mitigation in distributed optimization and learning
• AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs
• Variance reduction for root-finding problems
• A class of smooth exact penalty function methods for optimization problems with orthogonality constraints
• Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays
• Markov chain block coordinate descent
• Distributed deterministic asynchronous algorithms in time-varying graphs through Dykstra splitting
• Asynchronous level bundle methods
• Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
• DSCOVR: randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
• A new randomized primal-dual algorithm for convex optimization with fast last iterate convergence rates

This page was built for software: ARock