Fast Linear Iterations for Distributed Averaging

Proceedings of the IEEE Conference on Decision and Control

Volumn 5, Issue , 2003, Pages 4997-5002

  Xiao, Lin ^a   Boyd, Stephen ^a  

^a Stanford University   (United States)

Author keywords

Distributed consensus; Linear system; Semidefinite program; Spectral radius

Indexed keywords

ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; LAPLACE TRANSFORMS; LINEAR SYSTEMS; MATHEMATICAL MODELS; MATRIX ALGEBRA; VECTORS;

DISTRIBUTED AVERAGING; LINEAR ITERATIONS;

CONTROL SYSTEM ANALYSIS;

EID: 1542289981     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Francisco, CA, 1996.
2. R. Olfati-Saber and R. M. Murray. Consensus protocols for networks of dynamic agents. In Proc. of American Control Conference, Denver, CO, June 2003.
3. A. Jadbabaie, J. Lin, and A. S. Morse. Coordination of groups of mobile autonomous agents using nearest neighbor rules. To appear, IEEE Transactions Automatic Control, 2003.
4. C. D. Meyer and R. J. Plemmons. Convergence powers of a matrix with applications to iterative methods for singular linear systems. SIAM Journal on Numerical Analysis, 14(4):699-705, 1977.
5. M. L. Overton and R. S. Womersley. On minimizing the spectral radius of a nonsymmetric matrix function - optimality conditions and duality theory. SIAM J. Matrix Analysis & Applic., 9:473-498, 1988.
6. V. Blondel and J. N. Tsitsiklis. NP-hardness of some linear control design problems. SIAM Journal on Control and Optimization, 35:2118-2127, 1997.
7. A. Nemirovskii. Several NP-hard problems arising in robust stability analysis. Mathematics of Control, Signals and Systems, 6:99-105, 1993.
8. S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing Markov chain on a graph. Submitted to SIAM Review, problems and techniques section, February 2003. Available at http://www.stanford.edu/~boyd/fmmc.html.
9. L. Vandenberghe and S. Boyd. Semidefinite programming. SIAM Review, 38(1):49-95, 1996.
10. A. S. Lewis and M. L. Overton. Eigenvalue optimization. Acta Numerica, 5:149-190, 1996.
11. H. Wolkowicz, R. Saigal, and L. Vandengerghe, editors. Handbook of Semidefinite Programming, Theory, Algorithms, and Applications. Kluwer, 2000.
12. L. Xiao and S. Boyd. Fast linear iterations for distributed averaging. Submitted to Systems and Control Letters, March 2003. Available on the Internet at http://vww.Stanford.edu/~boyd/fastavg.html.
13. R. Merris. Laplacian matrices of graphs: a survey. Linear Algebra and Its Applic., 197:143-176, 1994.
14. C. Godsil and G. Royle. Algebraic Graph Theory. Springer, 2001.
15. A. Fax and R. M. Murray. Graph Laplacians and vehicle formation stabilization. In Proc. 15th IFAC World Congr. Automat. Control, Barcelona, July 2002.
16. M. Mesbahi. On a dynamic extension of the theory of graphs. In Proceedings of the American Control Conference, Anchorange, AL, May 2002.
17. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2003. Available at http://www.Stanford.edu/~boyd/cvxbook.html.
18. M. Fazel, H. Hindi, and S. Boyd. A rank minimization heuristic with application to minimum order system approximation. In Proc. American Control Conf., pages 4734-4739, Arlington, VA, June 2001.