A decomposition approach to distributed analysis of networked systems

Author

Langbort, Cedric ; Xiao, Lin ; Andrea, Raffaello D. ; Boyd, Stephen

Author_Institution

Dept. of Theor. & Appl. Mech., Cornell Univ., Ithaca, NY, USA

Volume

4

fYear

2004

fDate

14-17 Dec. 2004

Firstpage

3980

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.

Keywords

distributed algorithms; graph theory; interconnected systems; linear matrix inequalities; stability; arbitrary graph; coupled linear matrix inequalities; distributed algorithm; distributed analysis; interconnection variables; networked systems; primal decomposition; stability; subgradient method; very large systems; well-posedness; Algorithm design and analysis; Distributed algorithms; LAN interconnection; Linear matrix inequalities; Optimization methods; Parallel programming; Power system interconnection; Power system stability; Stability analysis; Symmetric matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2004. CDC. 43rd IEEE Conference on

ISSN

0191-2216

Print_ISBN

0-7803-8682-5

Type

conf

DOI

10.1109/CDC.2004.1429372

Filename

1429372