arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1104.2679math.OCcs.SYeess.SY
收藏

非凸半代数集的凸内逼近及其在固定阶控制器设计中的应用

Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design

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

Didier Henrion, Christophe Louembet

AI总结:

提出一种基于Gloptipoly 3的算法,通过凸半定规划构建非凸半代数集的凸内逼近,并应用于线性系统的固定阶控制器设计。

摘要:

我们描述了一种构建非凸集凸内逼近的基本算法。输入和输出集都是基本半代数集,以定义的多变量多项式列表形式给出。尽管无法给出最优性保证(例如,对于有界集的体积最大化),该算法旨在尽可能保留凸边界,同时移除具有凹边界的区域。特别地,该算法保持给定的凸集不变。该算法基于Gloptipoly 3,这是一个公共领域的Matlab包,借助凸半定规划(线性矩阵不等式或LMI上的优化)解决非凸多项式优化问题。我们展示了如何使用该算法,通过多项式方法设计线性系统的固定阶控制器。

英文摘要:

We describe an elementary algorithm to build convex inner approximations of nonconvex sets. Both input and output sets are basic semialgebraic sets given as lists of defining multivariate polynomials. Even though no optimality guarantees can be given (e.g. in terms of volume maximization for bounded sets), the algorithm is designed to preserve convex boundaries as much as possible, while removing regions with concave boundaries. In particular, the algorithm leaves invariant a given convex set. The algorithm is based on Gloptipoly 3, a public-domain Matlab package solving nonconvex polynomial optimization problems with the help of convex semidefinite programming (optimization over linear matrix inequalities, or LMIs). We illustrate how the algorithm can be used to design fixed-order controllers for linear systems, following a polynomial approach.

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

↑