Decomposition and Simultaneous Projection Methods for Convex Feasibility Problems with Application to robustness Analysis of Interconnected Uncertain Systems
2011 (English)Report (Other academic)
In this paper a speciﬁc class of convex feasibility problems are considered and tailored algorithms to solve this class of problems are introduced. First, the Nonlinear Cimmino Algorithm is reviewed. Then motivated by the special structure of the problems at hand, a modiﬁcation to this method is proposed. Next, another method for solving the dual problem of the provided problem is presented. This leads to similar update rules for the variables as in the modiﬁed Nonlinear Cimmino Algorithm. Then an application for the proposed algorithms on the robust stability analysis of large scale weakly interconnected systems is presented and the performance of the proposed methods are compared.
Place, publisher, year, edition, pages
Linköping: Linköping University Electronic Press, 2011. , 9 p.
LiTH-ISY-R, ISSN 1400-3902 ; 3012
Convex feasibility problems, Robust stability analysis, Decomposition, Simultaneous projection, Distributed
IdentifiersURN: urn:nbn:se:liu:diva-97955ISRN: LiTH-ISY-R-3012OAI: oai:DiVA.org:liu-97955DiVA: diva2:650779
FundereLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications