Fast Consensus by the Alternating Direction Multipliers Method
From MaRDI portal
Publication:4573323
DOI10.1109/TSP.2011.2162831zbMATH Open1391.93137OpenAlexW2106715795MaRDI QIDQ4573323FDOQ4573323
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
Nonlinear programming (90C30) Communication theory (94A05) Decentralized systems (93A14) Discrete-time control/observation systems (93C55)
Cited In (11)
- Fast and Effective Multiframe-Task Parameter Assignment Via Concave Approximations of Demand
- An overview of a class of clock synchronization algorithms for wireless sensor networks: a statistical signal processing perspective
- Fast Algorithms for Geometric Consensuses
- Is ADMM always faster than average consensus?
- Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems
- A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
- Relative tempo of distributed averaging on networks
- Synchronous distributed ADMM for consensus convex optimization problems with self-loops
- A randomized incremental primal-dual method for decentralized consensus optimization
- An accelerated decentralized stochastic optimization algorithm with inexact model
- Hierarchical design of fast minimum disagreement algorithms
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)
