Journal
SIAM JOURNAL ON CONTROL AND OPTIMIZATION
Volume 55, Issue 6, Pages 3990-4014Publisher
SIAM PUBLICATIONS
DOI: 10.1137/16M1076629
Keywords
consensus; distributed optimization; distributed algorithms
Categories
Funding
- NSF award [CMMI-1463262]
- AFOSR award [FA-95501510394]
Ask authors/readers for more resources
We describe a protocol for the average consensus problem on any fixed undirected graph whose convergence time scales linearly in the total number nodes n. The protocol relies only on nearest -neighbor interactions but requires all the nodes to know the same upper bound U on the total number of nodes which is correct within a constant multiplicative factor. As an application, we develop a distributed protocol for minimizing an average of (possibly nondifferentiable) convex functions (1/n) Sigma(n)(i=1) f(i)(theta) in the setting where only node i in an undirected, connected graph knows the function f(i)(theta). Under the same assumption about all nodes knowing U, and additionally assuming that the subgradients of each f(i)(theta) have absolute values bounded by some constant L known to the nodes, we show that after T iterations our protocol has error which is O(L root n/T). As a consequence, the time to solve this distributed optimization problem to any fixed accuracy is also linear in the number of nodes n.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available