Fast Consensus by the Alternating Direction Multipliers Method

DOI10.1109/TSP.2011.2162831MaRDI QIDQ4573323zbMATH OpenOpenAlexFDO

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

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) Decentralized systems (93A14) Discrete-time control/observation systems (93C55) Communication theory (94A05)

Cited in

(12)

• Is ADMM always faster than average consensus?
• Hierarchical design of fast minimum disagreement algorithms
• An overview of a class of clock synchronization algorithms for wireless sensor networks: a statistical signal processing perspective
• A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
• Relative tempo of distributed averaging on networks
• A randomized incremental primal-dual method for decentralized consensus optimization
• Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
• Fast Algorithms for Geometric Consensuses
• Synchronous distributed ADMM for consensus convex optimization problems with self-loops
• An accelerated decentralized stochastic optimization algorithm with inexact model
• The role of network connectivity in distributed k-agreement protocols
• Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573323)