Convergence Rates in Distributed Consensus and Averaging Export

@inproceedings{OlshevskyTsitsiklis_06, 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}, author = {Olshevsky, A. and Tsitsiklis, J. N.}, booktitle = {Decision and Control, 2006 45th IEEE Conference on}, citeulike-article-id = {3431717}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/CDC.2006.376899}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4177335}, doi = {10.1109/CDC.2006.376899}, journal = {Decision and Control, 2006 45th IEEE Conference on}, keywords = {consensus, convergence\_rate, distributed\_algorithms}, pages = {3387--3392}, posted-at = {2008-10-20 21:33:09}, priority = {2}, title = {Convergence Rates in Distributed Consensus and Averaging}, url = {http://dx.doi.org/10.1109/CDC.2006.376899}, year = {2006} }

TY - CONF ID - OlshevskyTsitsiklis_06 L3 - citeulike-article-id:3431717 N2 - 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 JF - Decision and Control, 2006 45th IEEE Conference on EP - 3392 TI - Convergence Rates in Distributed Consensus and Averaging T2 - Decision and Control, 2006 45th IEEE Conference on SP - 3387 KW - consensus KW - convergence_rate KW - distributed_algorithms AU - Olshevsky, A AU - Tsitsiklis, JN PY - 2006/// UR - http://dx.doi.org/10.1109/CDC.2006.376899 ER -