Decomposition and Projection Methods for Distributed Robustness Analysis of Interconnected Uncertain Systems
2013 (English)Conference paper (Refereed)
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. We use numerical results to show that both algorithms require far less iterations than the accelerated nonlinear Cimmino algorithm.
Place, publisher, year, edition, pages
2013. 194-199 p.
IdentifiersURN: urn:nbn:se:liu:diva-103912DOI: 10.3182/20130708-3-CN-2036.00008OAI: oai:DiVA.org:liu-103912DiVA: diva2:692893
13th IFAC Symposium on Large Scale Complex Systems: Theory and Applications