TY  - CHAP
N1  - 51st IEEE Conference on Decision and Control, held in Maui, Hawaii (USA); December 10-13 2012
N2  - This paper deals with the problem of finding a polytopic outer approximation P* of a compact semialgebraic set S ? Rn. The computed polytope turns out to be an approximation of the linear hull of the set S. The evaluation of P* is reduced to the solution of a sequence of robust optimization problems with nonconvex functional, which are efficiently solved by means of convex relaxation techniques. Properties of the presented algorithm and its possible applications in the analysis, identification and control of uncertain systems are discussed.
TI  - Polytopic outer approximations of semialgebraic sets
A1  - Cerone, Vito
A1  - Piga, Dario
A1  - Regruto, Diego
Y1  - 2012/12//
AV  - public
T2  - Proceedings of  the 51st Annual Conference on Decision and Control (CDC)
SN  - 978-1-4673-2064-1
SP  - 7793
KW  - Approximation algorithms; Approximation methods; Linear programming; Optimization; Polynomials; Robust stability; Robustness

EP  - 7798
UR  - http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6426221&isnumber=6425800
PB  - IEEE
ID  - eprints2453
ER  -