Optimal graph Laplacian
From MaRDI portal
Publication:1737851
DOI10.1016/j.automatica.2019.02.005zbMath1421.90155arXiv1802.06482OpenAlexW2962976136WikidataQ128384465 ScholiaQ128384465MaRDI QIDQ1737851
Publication date: 24 April 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.06482
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Computing the nearest correlation matrix--a problem from finance
- Mathematical frameworks for oscillatory network dynamics in neuroscience
- Complex-linear invariants of biochemical networks
- Synchronization in complex networks of phase oscillators: a survey
- Nearest stable system using successive convex approximations
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
- Laplacian dynamics on general graphs
- Dynamic mode decomposition of numerical and experimental data
- A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
- Synchronization in complex oscillator networks and smart grids
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Collective dynamics of ‘small-world’ networks
- Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers
- Structural Monostability of Activation-Inhibition Boolean Networks
This page was built for publication: Optimal graph Laplacian