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

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

2011-04-14

arxiv.org/abs/1104.2679v2

Mathematics

Optimization and Control

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-165282