Is ADMM always faster than average consensus?
From MaRDI portal
Recommendations
- A novel bound on the convergence rate of ADMM for distributed optimization
- Parallel alternating direction method of multipliers
- Fast linear iterations for distributed averaging
- Distributed computation of fast consensus weights using ADMM
- Distributed inexact dual consensus ADMM for network resource allocation
Cites work
- A survey on distributed estimation and control applications using linear consensus algorithms
- An Asynchronous Consensus-Based Algorithm for Estimation From Noisy Relative Measurements
- Convergence Rate of Distributed ADMM Over Networks
- Convergence speed in distributed consensus and averaging
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Explicit Convergence Rate of a Distributed Alternating Direction Method of Multipliers
- Fast Consensus by the Alternating Direction Multipliers Method
- Fast linear iterations for distributed averaging
- Fastest Mixing Markov Chain on a Graph
- Newton-Raphson Consensus for Distributed Convex Optimization
- The ADMM Algorithm for Distributed Quadratic Problems: Parameter Selection and Constraint Preconditioning
Cited in
(2)
This page was built for publication: Is ADMM always faster than average consensus?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1641079)