On Distributed Averaging Algorithms and Quantization Effects
We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is available, and on the degradation of performance when only quantized information is available. We st...
Main Authors: | Tsitsiklis, John N., Ozdaglar, Asuman E., Olshevsky, Alexander, Nedic, Angelia |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/53586 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-2658-8239 |
Similar Items
-
A lower bound for distributed averaging algorithms on the line graph
by: Tsitsiklis, John N., et al.
Published: (2012) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2010) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander, et al.
Published: (2020) -
Constrained Consensus and Optimization in Multi-Agent Networks
by: Nedic, Angelia, et al.
Published: (2011) -
Convergence speed in distributed consensus and averaging
by: Olshevsky, Alexander
Published: (2007)