A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
From MaRDI portal
Publication:2980337
DOI10.1109/TAC.2015.2512043zbMath1359.90090arXiv1407.0898OpenAlexW2963607435MaRDI QIDQ2980337
Pascal Bianchi, Franck Iutzeler, Walid Hachem
Publication date: 3 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.0898
Related Items (16)
A fully stochastic primal-dual algorithm ⋮ Randomized progressive hedging methods for multi-stage stochastic programming ⋮ Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems ⋮ Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays ⋮ Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators ⋮ Decentralized proximal splitting algorithms for composite constrained convex optimization ⋮ A distributed conjugate gradient online learning method over networks ⋮ A generic online acceleration scheme for optimization algorithms via relaxation and inertia ⋮ Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs ⋮ A distributed asynchronous method of multipliers for constrained nonconvex optimization ⋮ A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions ⋮ An Optimal Algorithm for Decentralized Finite-Sum Optimization ⋮ A randomized incremental primal-dual method for decentralized consensus optimization ⋮ Distributed composite optimization for multi-agent systems with asynchrony ⋮ Proximal Gradient Methods with Adaptive Subspace Sampling
This page was built for publication: A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization
