Fast Consensus by the Alternating Direction Multipliers Method

DOI10.1109/TSP.2011.2162831zbMath1391.93137OpenAlexW2106715795MaRDI QIDQ4573323

Emiliano Dall'Anese, Lorenzo Vangelista, Davide Zennaro, Tomaso Erseghe

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2011.2162831

Mathematics Subject Classification ID

Nonlinear programming (90C30) Discrete-time control/observation systems (93C55) Decentralized systems (93A14) Communication theory (94A05)

Related Items (7)

Is ADMM always faster than average consensus? ⋮ Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems ⋮ Synchronous distributed ADMM for consensus convex optimization problems with self-loops ⋮ An overview of a class of clock synchronization algorithms for wireless sensor networks: a statistical signal processing perspective ⋮ Relative tempo of distributed averaging on networks ⋮ A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment ⋮ A randomized incremental primal-dual method for decentralized consensus optimization

This page was built for publication: Fast Consensus by the Alternating Direction Multipliers Method