Distributed estimation of graph Laplacian eigenvalues by the Alternating Direction of Multipliers Method

IFAC Proceedings Volumes (IFAC-PapersOnline)

Volumn 19, Issue , 2014, Pages 5526-5531

  Tran, Thi Minh Dung ^a   Kibangou, Alain Y ^a  

^a CNRS   (France)

Author keywords

Alternating Direction of Multipliers Method; Average Consensus; Distributed optimization; Eigenvalues; Graph Laplacian

Indexed keywords

AUTOMATION; CONVEX OPTIMIZATION; EIGENVALUES AND EIGENFUNCTIONS; LAPLACE TRANSFORMS; MATRIX ALGEBRA; MULTI AGENT SYSTEMS; TOPOLOGY;

AVERAGE CONSENSUS; DISTRIBUTED OPTIMIZATION; EIGENVALUES; GRAPH LAPLACIAN; MULTIPLIERS METHOD;

INVERSE PROBLEMS;

EID: 84929815353     PISSN: 14746670     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3182/20140824-6-za-1003.02428     Document Type: Conference Paper

References (22)

1. Aragues, R., Shi, G., Dimarogonas, D., Sagues, C., and Johansson, K. (2012). Distributed algebraic connectivity estimation for adaptive event-triggered consensus. In Proc. of American Control Conf. (ACC), 2012, 32-37.
2. Boley, D. (2013). Local linear convergence of ADMM on quadratic or linear programs. SIAM J. on Optimization, 23(4), 2183-2207.
3. Boyd, S., Parikh, N., Chu, E., Peleato, B., and Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn., 3(1), 1-122.
4. Chung, F.R.K. (2012). Spectral Graph Theory. American Mathematical Society, Providence, RI.
5. Duchi, J., Agarwal, A., and Wainwright, M. (2012). Dual averaging for distributed optimization: Convergence analysis and network scaling. IEEE Trans. on Automatic Control, 57(3), 592-606.
6. Erseghe, T., Zennaro, D., Dall'Anese, E., and Vangelista, L. (2011). Fast consensus by the alternating direction multipliers method. IEEE Trans. on Signal Processing, 59(11), 5523-5537.
7. Franceschelli, M., Gasparri, A., Giua, A., and Seatzu, C. (2013). Decentralized estimation of Laplacian eigenvalues in multi-agent systems. Automatica, 49(4), 1031-1036.
8. Franceschelli, M., Martini, S., Egerstedt, M., Bicchi, A., and Giua, A. (2010). Observability and controllability verification in multi-agent systems through decentralized Laplacian spectrum estimation. In Proc. of the 49th IEEE Conf. on Decision and Control (CDC), 5775-5780. Atlanta, Georgia, USA.
9. Friedler, M. (1973). Algebraic connectivity of graphs. Czechoslovak Mathematical J., 23, 298-305.
10. Ghadimi, E., Teixeira, A., Shames, I., and Johansson, M. (2012). On the optimal step-size selection for the alternating direction method of multipliers. In the 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems (NecSys'12), Volume 3, 139-144. Santa Barbara, California.
11. Kibangou, A. (2011). Finite-time average consensus based protocol for distributed estimation over AWGN channels. In the 50th IEEE Conf. on Decision and Control and European Control Conf. (CDC-ECC), 5595-5600. Orlando, Fl, USA.
12. Kibangou, A. (2012). Graph Laplacian based matrix design for finite-time distributed average consensus. In Proc. of American Control Conf. (ACC), 1901-1906. Montréal, Canada.
13. Kibangou, A. (2014). Step-size sequence design for finite-time average consensus in secure wireless sensor networks. Systems and Control Letters, 67, 19-23.
14. Kibangou, A. and Commault, C. (2012). Decentralized Laplacian eigenvalues estimation and collaborative network topology identification. In the 3rd IFAC Workshop on Distributed Estimation and Control in Networked Systems (NecSys'12), 7-12. Santa Barbara, USA.
15. Merris, R. (1994). Laplacian matrices of a graph: a survey. Linear Algebra and its Applications, 197, 143-176.
16. Nedic, A., Ozdaglar, A., and Parrilo, P. (2010). Constrained consensus and optimization in multi-agent networks. IEEE Trans. on Automatic Control, 55(4), 922-938.
17. Olfati-saber, R., Fax, J.A., and Murray, R.M. (2010). Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 98(7), 1353-1354.
18. Sahai, T., Speranzon, A., and Banaszuk, A. (2012). Hearing the cluster of a graph: A distributed algorithm. Automatica, 48(1), 15-24.
19. Teixeira, A., Ghadimi, E., Shames, I., Sandberg, H., and Johansson, M. (2013). Optimal scaling of the ADMM algorithm for distributed quadratic programming. In Proc. of the 52nd IEEE Conf. on Decision and Control (CDC), 6868-6873. Florence, Italy.
20. Tran, T. and Kibangou, A. (2013). Consensus-based distributed estimation of Laplacian eigenvalues of undirected graphs. In Proc. of the European Control Conf. (ECC 2013), 227-232. Zurich, Switzerland.
21. Xiao, L. and Boyd, S. (2004). Fast linear iterations for distributed averaging. Systems Control Letters, 53, 65-78.
22. Yang, P., Freeman, R.A., Gordon, G., Lynch, K., Srinivasa, S., and Sukthankar, R. (2008). Decentralized estimation and control of graph connectivity in mobile sensor networks. In Proc. of American Control Conf. (ACC), 2678-2683. Seattle, Washington, USA.