Maximizing the smallest eigenvalue of a symmetric matrix: a submodular optimization approach

DOI10.1016/j.automatica.2018.06.016zbMath1402.93130arXiv1709.02212OpenAlexW2964172163MaRDI QIDQ1626929

Y. Aharonov

Publication date: 21 November 2018

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.02212

zbMATH Keywords

optimizationeigenvaluesmatrix algebranetworkssubmodularitydistributed controlnetworked control

Mathematics Subject Classification ID

Eigenvalue problems (93B60) Decentralized systems (93A14) Positive matrices and their generalizations; cones of matrices (15B48) Software, source code, etc. for problems pertaining to systems and control theory (93-04)

Related Items

Structural balance of multiplex signed networks: a distributed data-driven approach, Leader selection in networks under switching topologies with antagonistic interactions, A randomized approach to sensor placement with observability assurance, Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition, Multi-agent control: a graph-theoretic perspective

Cites Work

• Unnamed Item
• Submodular spectral functions of principal submatrices of a Hermitian matrix, extensions and applications
• Normalized graph Laplacians for directed graphs
• M-matrix characterizations. I: nonsingular M-matrices
• Bounds for eigenvalues using the trace and determinant
• An analysis of the greedy algorithm for the submodular set covering problem
• Behaviors of networks with antagonistic interactions and switching topologies
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Submodular functions and optimization.
• On the Smallest Eigenvalue of Grounded Laplacian Matrices
• Minimizing Convergence Error in Multi-Agent Systems Via Leader Selection: A Supermodular Optimization Approach
• A Supermodular Optimization Framework for Leader Selection Under Link Noise in Linear Multi-Agent Systems
• Matrix Analysis
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• On Submodularity and Controllability in Complex Dynamical Networks
• On the Robustness of Uncertain Consensus Networks
• Computing the distribution of quadratic forms in normal variables