A decomposition approach to distributed analysis of networked systems

Cédric Langbort, Lin Xiao, Raffaello D'Andrea, Stephen Boyd

Research output: Contribution to journalConference articlepeer-review

15 Scopus citations

Abstract

We present a simple distributed algorithm for analyzing well-posedness and stability of a system composed of different sub-units, interconnected over an arbitrary graph. The procedure consists in solving a set of coupled linear matrix inequalities via a subgradient method, with primal decomposition. The proposed algorithm can be implemented in parallel on the system's graph and should prove more efficient than conventional semidefinite programming solvers, for very large systems with a high number of states and interconnection variables.

Original languageEnglish
Article numberThC10.1
Pages (from-to)3980-3985
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume4
DOIs
StatePublished - 2004
Externally publishedYes
Event2004 43rd IEEE Conference on Decision and Control (CDC) - Nassau, Bahamas
Duration: Dec 14 2004Dec 17 2004

Fingerprint

Dive into the research topics of 'A decomposition approach to distributed analysis of networked systems'. Together they form a unique fingerprint.

Cite this