A novel bound on the convergence rate of ADMM for distributed optimization

DOI10.1016/j.automatica.2022.110403zbMath1496.93018OpenAlexW4281286148MaRDI QIDQ2151926

Ruggero Carli, Nicola Bastianello, Luca Schenato

Publication date: 5 July 2022

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2022.110403

zbMATH Keywords

ADMMconvergence ratemulti-agent systemsnumerical algorithmsstatic optimization problems

Mathematics Subject Classification ID

Multi-agent systems (93A16) Consensus (93D50)

Related Items (1)

A local-minimization-free zero-gradient-sum algorithm for distributed optimization

Uses Software

• ARock

Cites Work

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Is ADMM always faster than average consensus?
• ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates
• Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
• Convergence Rate of Distributed ADMM Over Networks
• On the Linear Convergence of the ADMM in Decentralized Consensus Optimization
• A generic online acceleration scheme for optimization algorithms via relaxation and inertia
• Asynchronous Distributed Optimization Over Lossy Networks via Relaxed ADMM: Stability and Linear Convergence

This page was built for publication: A novel bound on the convergence rate of ADMM for distributed optimization