Convergence rates in distributed consensus and averaging

Alex Olshevsky, John N. Tsitsiklis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence rates of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the convergence time.

Original languageEnglish (US)
Title of host publicationProceedings of the 45th IEEE Conference on Decision and Control 2006, CDC
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages3387-3392
Number of pages6
ISBN (Print)1424401712, 9781424401710
DOIs
StatePublished - 2006
Externally publishedYes
Event45th IEEE Conference on Decision and Control 2006, CDC - San Diego, CA, United States
Duration: Dec 13 2006Dec 15 2006

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other45th IEEE Conference on Decision and Control 2006, CDC
Country/TerritoryUnited States
CitySan Diego, CA
Period12/13/0612/15/06

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint

Dive into the research topics of 'Convergence rates in distributed consensus and averaging'. Together they form a unique fingerprint.

Cite this