Decomposition and Simultaneous Projection Methods for Convex Feasibility Problems with Application to robustness Analysis of Interconnected Uncertain Systems
作者： Anders Rantzer , Sina Khoshfetrat Pakazad , Anders Hansson , Martin S. Andersen
DOI:
关键词: Nonlinear system 、 Uncertain systems 、 Robustness (computer science) 、 Mathematical optimization 、 Mathematics 、 Regular polygon
摘要: In this paper a specific class of convex feasibility problems are considered and tailored algorithms to solve introduced. First, the Nonlinear Cimmino Algorithm is reviewed. Then motivated by special structure at hand, modification method proposed. Next, another for solving dual problem provided presented. This leads similar update rules variables as in modified Algorithm. an application proposed on robust stability analysis large scale weakly interconnected systems presented performance methods compared.
参考文章(20)
Dimitri P. Bertsekas, Expository & survey paper: Multiplier methods: A survey Automatica. ,vol. 12, pp. 133- 145 ,(1976) , 10.1016/0005-1098(76)90077-7
K. C. Kiwiel, Generalized Bregman Projections in Convex Feasibility Problems Journal of Optimization Theory and Applications. ,vol. 96, pp. 139- 157 ,(1998) , 10.1023/A:1022619318462
Yair Censor, Iterative Methods for the Convex Feasibility Problem North-Holland Mathematics Studies. ,vol. 87, pp. 83- 91 ,(1984) , 10.1016/S0304-0208(08)72812-3
Naonori Kakimura, A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices Linear Algebra and its Applications. ,vol. 433, pp. 819- 823 ,(2010) , 10.1016/J.LAA.2010.04.012
Alfredo N. Iusem, Alvaro Rodolfo De Pierro, Convergence results for an accelerated nonlinear cimmino algorithm Numerische Mathematik. ,vol. 49, pp. 367- 378 ,(1986) , 10.1007/BF01389537
Lucio Tunes Dos Santos, A parallel subgradient projections method for the convex feasibility problem Journal of Computational and Applied Mathematics. ,vol. 18, pp. 307- 320 ,(1987) , 10.1016/0377-0427(87)90004-5
Dan Butnariu, Yair Censor, Pini Gurfil, Ethan Hadar, On The Behavior of Subgradient Projections Methods for Convex Feasibility Problems in Euclidean Spaces Siam Journal on Optimization. ,vol. 19, pp. 786- 807 ,(2008) , 10.1137/070689127
Shih-Ping Han, A successive projection method Mathematical Programming. ,vol. 40, pp. 1- 14 ,(1988) , 10.1007/BF01580719
Sunyoung Kim, Masakazu Kojima, Martin Mevissen, Makoto Yamashita, Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion Mathematical Programming. ,vol. 129, pp. 33- 68 ,(2011) , 10.1007/S10107-010-0402-6
L.M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming USSR Computational Mathematics and Mathematical Physics. ,vol. 7, pp. 200- 217 ,(1967) , 10.1016/0041-5553(67)90040-7