Is ADMM always faster than average consensus?

DOI10.1016/j.automatica.2018.01.009zbMath1387.93069OpenAlexW2790830321MaRDI QIDQ1641079

Nicoletta Bof, Luca Schenato, Ruggero Carli

Publication date: 14 June 2018

Published in: Automatica (Search for Journal in Brave)

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

zbMATH Keywords

optimization problemsdistributed controlaverage consensusalternating direction method of multipliers (ADMM)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

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

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Fast linear iterations for distributed averaging
• Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
• Newton-Raphson Consensus for Distributed Convex Optimization
• Convergence Rate of Distributed ADMM Over Networks
• Fast Consensus by the Alternating Direction Multipliers Method
• The ADMM Algorithm for Distributed Quadratic Problems: Parameter Selection and Constraint Preconditioning
• Fastest Mixing Markov Chain on a Graph
• Convergence Speed in Distributed Consensus and Averaging
• An Asynchronous Consensus-Based Algorithm for Estimation From Noisy Relative Measurements

This page was built for publication: Is ADMM always faster than average consensus?