Convergence speed in distributed consensus and averaging
Name
110837462.pdf
Description
Published version
Size
325.32 KB
Format
Adobe PDF
Checksum (MD5)
99e25047589c452f211e85241a7552e2
Author(s)
Olshevsky, Alexander
Tsitsiklis, John N.
Date Issued
November 2011
Journal
SIAM review
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Citation
Olshevsky, Alexander and John N. Tsitsiklis, "Convergence speed in distributed consensus and averaging." SIAM review 53, 4 (November 2011): p. 747-72 doi 10.1137/110837462 ©2011 Author(s)
Version
Final published version
Abstract
We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm. ©2011
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1137/110837462
