Distributed estimation of Laplacian eigenvalues via constrained consensus optimization problems
From MaRDI portal
Publication:893994
DOI10.1016/j.sysconle.2015.04.001zbMath1330.93112OpenAlexW280617973MaRDI QIDQ893994
Alain Y. Kibangou, Thi-Minh-Dung Tran
Publication date: 23 November 2015
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2015.04.001
matrix factorizationdistributed optimizationalternating direction method of multipliers (ADMM)distributed subgradient algorithmsgraph Laplacian eigenvalues
Eigenvalue problems (93B60) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)
Related Items
A dynamical approach to efficient eigenvalue estimation in general multiagent networks, Spectral Identification of Networks Using Sparse Measurements, Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs, Multi-agent control: a graph-theoretic perspective, Consensus of second-order multi-agent systems under unknown but bounded measurement noises
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Hearing the clusters of a graph: A distributed algorithm
- Decentralised minimum-time consensus
- Decentralized estimation and control of graph connectivity for mobile sensor networks
- Laplacian matrices of graphs: A survey
- Decentralized estimation of Laplacian eigenvalues in multi-agent systems
- Fast linear iterations for distributed averaging
- Fast Consensus by the Alternating Direction Multipliers Method
- Constrained Consensus and Optimization in Multi-Agent Networks
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs