arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1104.4905math.OCcs.SYeess.SY
收藏

多项式矩阵不等式与鲁棒稳定区域的内逼近

Inner approximations for polynomial matrix inequalities and robust stability regions

CNRS(法国国家科学研究中心;系统分析与研究实验室);LAAS(图卢兹大学);Université de Toulouse(布拉格捷克理工大学电气工程学院);UPS, INSA, INP, ISAE(图卢兹数学研究所);UT1, UTM, LAAS;Faculty of Electrical Engineering, Czech Technical University in Prague;Institut de Mathématiques de Toulouse, Université de Toulouse

Didier Henrion, Jean Bernard Lasserre

AI总结:

针对参数化多项式矩阵不等式描述的非凸可行集,提出线性矩阵不等式层次结构,通过单一多项式子水平集生成内逼近,并证明其强解析收敛性,同时可施加嵌套或凸性约束。

摘要:

采用多项式方法,许多鲁棒固定阶控制器设计问题可以表述为优化问题,其可行解集由参数化多项式矩阵不等式(PMI)建模。这些可行集通常是非凸的。给定一个参数化PMI集,我们提供了一个线性矩阵不等式(LMI)问题的层次结构,其最优解生成由单个多项式子水平集建模的内逼近。这些内逼近在强解析意义下收敛到非凸原始可行集,且保守性渐近消失。还可以强制内逼近层次结构是嵌套的或凸的。在后一种情况下,它们不再收敛到可行集,但可以在凸优化框架中使用,代价是存在一定的保守性。最后,我们表明,非凸多项式稳定区域的特定几何结构可用于改进内逼近层次结构的收敛性。

英文摘要:

Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These feasibility sets are typically nonconvex. Given a parametrized PMI set, we provide a hierarchy of linear matrix inequality (LMI) problems whose optimal solutions generate inner approximations modelled by a single polynomial sublevel set. Those inner approximations converge in a strong analytic sense to the nonconvex original feasible set, with asymptotically vanishing conservatism. One may also impose the hierarchy of inner approximations to be nested or convex. In the latter case they do not converge any more to the feasible set, but they can be used in a convex optimization framework at the price of some conservatism. Finally, we show that the specific geometry of nonconvex polynomial stability regions can be exploited to improve convergence of the hierarchy of inner approximations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑