By Topic

A decomposition approach to distributed analysis of networked systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Langbort, C. ; Dept. of Theor. & Appl. Mech., Cornell Univ., Ithaca, NY, USA ; Lin Xiao ; D'Andrea, R. ; Boyd, S.

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.

Published in:

Decision and Control, 2004. CDC. 43rd IEEE Conference on  (Volume:4 )

Date of Conference:

14-17 Dec. 2004