Decomposition and Projection Methods for Distributed Robustness Analysis of Interconnected Uncertain Systems - Danish National Research Database-Den Danske Forskningsdatabase

Pakazad, Sina Khoshfetrat^{3}; Hansson, Anders^{3}; Andersen, Martin Skovgaard^{1}; Rantzer, Anders^{3}

Affiliations:

^{1} Department of Applied Mathematics and Computer Science, Technical University of Denmark^{2} Scientific Computing, Department of Applied Mathematics and Computer Science, Technical University of Denmark^{3} unknown

DOI:

10.3182/20130708-3-CN-2036.00008

Abstract:

We consider a class of convex feasibility problems where the constraints that describe the feasible set are loosely coupled. These problems arise in robust stability analysis of large, weakly interconnected uncertain systems. To facilitate distributed implementation of robust stability analysis of such systems, we describe two algorithms based on decomposition and simultaneous projections. The first algorithm is a nonlinear variant of Cimmino's mean projection algorithm, but by taking the structure of the constraints into account, we can obtain a faster rate of convergence. The second algorithm is devised by applying the alternating direction method of multipliers to a convex minimization reformulation of the convex feasibility problem. Numerical results are then used to show that both algorithms require far less iterations than the accelerated nonlinear Cimmino algorithm.

ISBN:

9783902823397

Type:

Conference paper

Language:

English

Published in:

Ifac Proceedings Volumes, 2013, p. 194-199

Keywords:

Distributed computer systems; Large scale systems; Uncertain systems; Algorithms

Main Research Area:

Science/technology

Publication Status:

Published

Series:

Ifac Proceedings Volumes (ifac-papersonline)

Review type:

Peer Review

Conference:

13th IFAC Symposium on Large Scale Complex Systems: Theory and Applications (LSS 2013)