Decomposition and Projection Methods for Distributed Robustness Analysis of Interconnected Uncertain Systems
2011 (English)Report (Other academic)
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 systems. To facilitate distributed implementation of robust stability analysis of such systems, we propose 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. We use numerical results to show that both algorithms require far less iterations than the accelerated nonlinear Cimmino algorithm.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2011. , 24 p.
LiTH-ISY-R, ISSN 1400-3902 ; 3033
Robust stability analysis, Convex feasibility problems, Projection algorithms, Decomposition, Distributed computing
IdentifiersURN: urn:nbn:se:liu:diva-72209ISRN: LiTH-ISYR- 3033OAI: oai:DiVA.org:liu-72209DiVA: diva2:458302
FundereLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications