Fast linear iterations for distributed averaging

Systems and Control Letters

Volumn 53, Issue 1, 2004, Pages 65-78

  Xiao, Lin ^a   Boyd, Stephen ^a  

^a Stanford University ^*  (United States)

Author keywords

Distributed consensus; Graph Laplacian; Linear system; Semidefinite programming; Spectral radius

Indexed keywords

ASYMPTOTIC STABILITY; GRAPH THEORY; HEURISTIC METHODS; INFORMATION DISSEMINATION; LAPLACE TRANSFORMS; LINEAR SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; VECTORS;

DISTRIBUTED CONSENSUS; GRAPH LAPLACIAN; SEMIDEFINITE PROGRAMMING; SPECTRAL RADII;

ITERATIVE METHODS;

EID: 3142770678     PISSN: 01676911     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysconle.2004.02.022     Document Type: Article

References (44)

1. Alizadeh F. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5:1995;13-51.
2. A. Ben-Tal, A. Nemirovski, Lectures on Modern Convex Optimization, Analysis, Algorithms, and Engineering Applications, MPS/SIAM Series on Optimization, SIAM, Philadelphia, PA, 2001.
3. Benson S., Ye Y., Zhang X. Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim. 10:2000;443-461.
4. D.P. Bertsekas, Nonlinear Programming, 2nd Edition, Athena Scientific, Belmont, MA, 1999.
5. Biggs N. Algebraic Graph Theory. 2nd Edition:1993;Cambridge University Press, Cambridge.
6. Blondel V., Tsitsiklis J.N. NP-hardness of some linear control design problems. SIAM J. Control Optim. 35:1997;2118-2127.
7. Borwein J.M., Lewis A.S. Convex Analysis and Nonlinear Optimization, Theory and Examples, Canadian Mathematical Society Books in Mathematics. 2000;Springer, New York.
8. S. Boyd, P. Diaconis, P. Parrilo, L. Xiao, Symmetry analysis of reversible Markov chains, Submitted to Internet Mathematics, December 2003, Also available online at: http://www.stanford.edu/~boyd/symmetry.html.
9. S. Boyd, P. Diaconis, L. Xiao, Fastest mixing Markov chain on a graph, SIAM Review, in press, Available at: http://www.stanford.edu/~boyd/fmmc.html .
10. Boyd S., El Ghaoui L. Method of centers for minimizing generalized eigenvalues. Linear Algebra Appl. 188:1993;63-111.
11. Boyd S., El Ghaoui L., Feron E., Balakrishnan V. Linear Matrix Inequalities in System and Control Theory. 1994;SIAM, Philadelphia.
12. Boyd S., Vandenberghe L. Convex Optimization. 2003;Cambridge University Press, Cambridge. Available at http://www.stanford.edu/~boyd/cvxbook.html.
13. A. Fax, R.M. Murray, Graph Laplacians and vehicle formation stabilization, in: Proceedings of the 15th IFAC World Congress on Automatic Control, Barcelona, Spain, July 2002.
14. A. Fax, R.M. Murray, Information flow and cooperative control of vehicle formations, in: Proceedings of the 15th IFAC World Congress on Automatic Control, Barcelona, Spain, July 2002.
15. M. Fazel, H. Hindi, S. Boyd, A rank minimization heuristic with application to minimum order system approximation, in: Proceedings American Control Conference, Vol. 6, Arlington, VA, June 2001, pp. 4734-4739.
16. L. El Ghaoui, S.-I. Niculescu (Eds.), Advances on Linear Matrix Inequality Methods in Control, SIAM, Philadelphia, 1999.
17. C. Godsil, G. Royle, Algebraic Graph Theory, Graduate Texts in Mathematics, Vol. 207, Springer, Berlin, 2001.
18. Hassibi A., How J., Boyd S. Low-authority controller design via convex optimization. AIAA J. Guidance Control Dynam. 22(6):1999;862-872.
19. Helmberg C., Rendl F. A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3):2000;673-696.
20. Hiriart-Urruty J.-B., Lemaréchal C. Convex Analysis and Minimization Algorithms. 1993;Springer, Berlin.
21. A. Jadbabaie, J. Lin, A.S. Morse, Coordination of groups of mobile autonomous agents using nearest neighbor rules, IEEE Trans. Autom. Control 48(6) (2003) 988-1001.
22. Lewis A.S., Overton M.L. Eigenvalue optimization. Acta Num. 5:1996;149-190.
23. Lynch N.A. Distributed Algorithms. 1996;Morgan Kaufmann, San Francisco, CA.
24. Merris R. Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197:1994;143-176.
25. M. Mesbahi, On a dynamic extension of the theory of graphs, in: Proceedings of the American Control Conference, Anchorange, AL, May 2002.
26. Meyer C.D., Plemmons R.J. Convergence powers of a matrix with applications to iterative methods for singular linear systems. SIAM J. Num. Anal. 14(4):1977;699-705.
27. L. Moreau, Stability of multi-agent system with time-dependent communication links, IEEE Trans. Automat. Control, in press.
28. ∞ Control, Lecture Notes in Control and Information Sciences, Vol. 146, Springer, Berlin, 1990.
29. Nemirovskii A. Several NP-hard problems arising in robust stability analysis. Math. Control Signals Systems. 6:1993;99-105.
30. A. Nemirovskii, Prox-method with rate of convergence O(1/t) for Lipschitz continuous variational inequalities and smooth convex-concave saddle point problems, Personal communication, 2003.
31. Nesterov Y., Nemirovskii A. Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics. 1994;SIAM, Philadelphia, PA.
32. Oldenburger R. Infinite powers of matrices and characteristic roots. Duke Math. J. 6:1940;357-361.
33. R. Olfati-Saber, R.M. Murray, Consensus protocols for networks of dynamic agents, in: Proceedings of American Control Conference, Denver, CO, June 2003.
34. Overton M.L. Large-scale optimization of eigenvalues. SIAM J. Optim. 2:1992;88-120.
35. Overton M.L., Womersley R.S. On minimizing the spectral radius of a nonsymmetric matrix function - optimality conditions and duality theory. SIAM J. Matrix Anal. Appl. 9:1988;473-498.
36. Overton M.L., Womersley R.S. Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices. Math. Programming. 62:1993;321-357.
37. Parlett B.N. The Symmetric Eigenvalue Problem. 1980;Prentice-Hall, Englewood Cliffs, NJ.
38. Rockafellar R.T. Convex Analysis. 1970;Princeton University Press, Princeton, NJ.
39. Saad Y. Numerical Methods for Large Eigenvalue Problems. 1992;Manchester University Press, Manchester, UK.
40. Shor N.Z. Minimization Methods for Non-differentiable Functions, Springer Series in Computational Mathematics. 1985;Springer, Berlin.
41. Todd M. Semidefinite optimization. Acta Num. 10:2001;515-560.
42. Vandenberghe L., Boyd S. Semidefinite programming. SIAM Rev. 38(1):1996;49-95.
43. H. Wolkowicz, R. Saigal, L. Vandengerghe (Eds.), Handbook of Semidefinite Programming, Theory, Algorithms, and Applications, Kluwer Academic Publishers, Dordrecht, 2000.
44. Ye Y. Interior Point Algorithms: Theory and Analysis, Wiey-Interscience Series in Discrete Mathematics and Optimization. 1997;Wiley, New York.