Distributed average consensus with least-mean-square deviation

Journal of Parallel and Distributed Computing

Volumn 67, Issue 1, 2007, Pages 33-46

  Xiao, Lin ^a   Boyd, Stephen ^b   Kim, Seung Jean ^b  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

^b Stanford University   (United States)

Author keywords

Convex optimization; Distributed average consensus; Edge transitive graphs; Least mean square

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; LEAST SQUARES APPROXIMATIONS; MATHEMATICAL MODELS; OPTIMIZATION; RANDOM PROCESSES;

CONVEX OPTIMIZATION; DISTRIBUTED AVERAGE CONSENSUS; EDGE-TRANSITIVE GRAPHS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 34250899886     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2006.08.010     Document Type: Article

References (35)

1. Bertsekas D.P. Nonlinear of Programming. second ed. (1999), Athena Scientific
2. V.D. Blondel, J.M. Hendrickx, A. Olshevsky, J.N. Tsitsiklis, Convergence in multiagent coordination, consensus, and flocking, in: Proceedings of IEEE Conference on Decision and Control, Seville, Spain, 2005, pp. 2996-3000.
3. Boillat J. Load balancing and Poisson equation in a graph. Concurrency: Practice and Experience 2 (1990) 289-313
4. Borwein J.M., and Lewis A.S. Convex analysis and nonlinear optimization, theory and examples, Canadian Mathematical Society Books in Mathematics (2000), Springer, New York
5. S. Boyd, P. Diaconis, P.A. Parrilo, L. Xiao, Symmetry analysis of reversible Markov chains, Internet Mathematics 2 (1) (2005) 31-71.
6. Boyd S., Diaconis P., and Xiao L. Fastest mixing Markov chain on a graph. SIAM Rev. problems and techniques section 46 4 (2004) 667-689
7. S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, Cambridge, MA, 2004, Available at: 〈http://www.stanford.edu/~boyd/cvxbook.html〉.
8. Brémaud P. Markov chains, Gibbs fields, Monte Carlo simulation and queues, Texts in Applied Mathematics (1999), Springer, Berlin, Heidelberg
9. Cybenko G. Load balancing for distributed memory multiprocessors. J. Parallel and Distributed Computing 7 (1989) 279-301
10. Diaconis P., and Stroock D. Geometric bounds for eigenvalues of Markov chains. The Ann. Appl. Probab. 1 1 (1991) 36-61
11. Elsässer R., Monien B., and Preis R. Diffusive load balancing schemes on heterogeneous networks. Theory Comput. Systems 35 (2002) 305-320
12. Gatermann K., and Parrilo P.A. Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192 (2004) 95-128
13. Jadbabaie A., Lin J., and Morse A.S. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Automat. Control 48 6 (2003) 988-1001
14. Lewis A.S. Convex analysis on the Hemitian matrices. SIAM J. Optim. 6 (1996) 164-177
15. Lewis A.S., and Sendov H.S. Twice differentiable spectral functions. SIAM J. Matrix Anal. Appl. 23 (2001) 368-386
16. Luenberger D.G. Introduction to Linear and Nonlinear Programming. second ed. (1984), Addison-Wesley, Reading, MA
17. Lynch N.A. Distributed Algorithms (1996), Morgan Kaufmann Publishers, San Francisco, CA
18. C.C. Moallemi, B. Van Roy, Consensus propagation. Draft, 2005.
19. B. Mohar, Some applications of Laplace eigenvalues of graphs, in: G. Hahn, G. Sabidussi (Eds.), Graph Symmetry: Algebraic Methods and Applications, NATO ASI Series C 497, Kluwer Academic Publishers, Dordrecht, MA, 1997, pp. 225-275.
20. L. Moreau, Stability of multi-agent systems with time-dependent communication links, IEEE Trans. Automat. Control 50 (2) (2005) 169-182.
21. Nocedal J., and Wright S.J. Numerical Optimization, Springer Series in Operations Research (1999), Springer, New York
22. Olfati-Saber R., and Murray R.M. Consensus problems in networks of agents with switching topology and time-delays. IEEE Trans. Automat. Control 49 9 (2004) 1520-1533
23. Overton M.L., and Womersley R.S. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math. Programming 62 (1993) 321-357
24. P.A. Parrilo, L. Xiao, S. Boyd, P. Diaconis, Fastest mixing Markov chain on graphs with symmetries, Draft, 2006.
25. B. Patt-Shamir, S. Rajsbaum, A theory of clock synchronization, in: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, Montreal, Canada, 1994, pp. 810-819.
26. W. Ren, R.W. Beard, Consensus seeking in multi-agent systems under dynamically changing interaction topologies, IEEE Trans. Automat. Control 50 (5) (2005) 655-661.
27. Rotaru T., and Nägeli H.-H. Dynamic load balancing by diffusion in heterogeneous systems. J. Parallel and Distributed Comput. 64 4 (2004) 481-497
28. D.S. Scherber, H.C. Papadopoulos, Locally constructed algorithms for distributed computations in ad-hoc networks, in: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, Berkeley, CA, April 2004. ACM Press, New York, pp. 11-19.
29. D.P. Spanos, R. Olfati-Saber, R.M. Murray, Distributed sensor fusion using dynamic consensus, in: Proceedings of the 16th IFAC World Congress, Prague, Czech, 2005.
30. R. Subramanian, I.D. Scherson, An analysis of diffusive load-balancing, in: Proceedings of the Sixth Annual ACM Symposium on Parallel Algorithms and Architectures, Cape May, NJ, USA, 1994, pp. 220-225.
31. J.N. Tsitsiklis, Problems in decentralized decision making and computation, Ph.D. Thesis, Massachusetts Institute of Technology, 1984.
32. Tsitsiklis J.N., Bertsekas D.P., and Athans M. Distributed asynchronous deterministic and stochastic gradient optimization algorithms. IEEE Trans. Automat. Control 31 9 (1986) 803-812
33. Xiao L., and Boyd S. Fast linear iterations for distributed averaging. Systems Control Lett. 53 (2004) 65-78
34. L. Xiao, S. Boyd, S. Lall, A scheme for robust distributed sensor fusion based on average consensus, in: Proceedings of the Fourth International Conference on Information Processing in Sensor Networks, Los Angeles, California, USA, 2005, pp. 63-70.
35. Xu C.-Z., and Lau F. Load Balancing in Parallel Computers: Theory and Practice (1997), Kluwer Academic Publishers, Dordrecht, MA