Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
From MaRDI portal
Publication:2980596
DOI10.1109/TAC.2015.2448011zbMath1359.90103arXiv1312.1085OpenAlexW4300028551MaRDI QIDQ2980596
Franck Iutzeler, Pascal Bianchi, Philippe Ciblat, 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/1312.1085
Related Items (18)
Is ADMM always faster than average consensus? ⋮ A novel bound on the convergence rate of ADMM for distributed optimization ⋮ Distributed support vector machine in master-slave mode ⋮ Convergence rate analysis of distributed optimization with projected subgradient algorithm ⋮ Tracking-ADMM for distributed constraint-coupled optimization ⋮ Tight global linear convergence rate bounds for Douglas-Rachford splitting ⋮ A stochastic averaging gradient algorithm with multi‐step communication for distributed optimization ⋮ Multi-cluster distributed optimization via random sleep strategy ⋮ Linear Time Average Consensus and Distributed Optimization on Fixed Graphs ⋮ A generic online acceleration scheme for optimization algorithms via relaxation and inertia ⋮ Revisiting EXTRA for Smooth Distributed Optimization ⋮ A distributed asynchronous method of multipliers for constrained nonconvex optimization ⋮ Decentralized Consensus Algorithm with Delayed and Stochastic Gradients ⋮ A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment ⋮ Augmented Lagrange algorithms for distributed optimization over multi-agent networks via edge-based method ⋮ Distributed decision-coupled constrained optimization via proximal-tracking ⋮ Risk-averse stochastic programming and distributionally robust optimization via operator splitting ⋮ EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
This page was built for publication: Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
