Referenced Items are not available for this document.
We adjust the node and edge weightings of graphs using convex optimization to impose bounds on their Laplacian spectra. We first derive necessary and sufficient conditions that characterize the feasibility of spectral bounds given positive node and edge weightings. Next, we propose algorithms that exploit convexity to achieve these bounds. The design and analysis tools are useful for a variety of stability and control problems in multi-agent systems.
Published in:
Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on
Date of Conference: 12-15 Dec. 2011
- Page(s):
- 5541 - 5546
- ISSN :
- 0743-1546
- E-ISBN :
- 978-1-61284-799-3
- Print ISBN:
- 978-1-61284-800-6
- INSPEC Accession Number:
- 12590481
- Conference Location :
- Orlando, FL
- Digital Object Identifier :
- 10.1109/CDC.2011.6160545
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
