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

DOI10.1080/00207179.2012.675521MaRDI QIDQ5745606zbMATH OpenOpenAlexFDO

Authors Didier Henrion, Christophe Louembet

Publication date 30 January 2014

Published in International Journal of Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1104.2679

zbMATH Keywords

polynomialsLMIfixed-order controller designnonconvex optimisation

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Design techniques (robust design, computer-aided design, etc.) (93B51) Stability of control systems (93D99) Algebraic methods (93B25)

Abstract: 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.

Recommendations

• Simple approximations of semialgebraic sets and their applications to control
• scientific article; zbMATH DE number 1070482
• Fixed-order \(H_\infty\) controller design for nonparametric models by convex optimization
• Structured finite-dimensional controller design by convex optimization
• Semidefinite programming relaxations and algebraic optimization in control
• Controller design for a class of nonlinear systems with input saturation using convex optimization
• Nonlinear control design for linear differential inclusions via convex hull of quadratics
• On the approximate controllability of semilinear control systems
• scientific article; zbMATH DE number 716506
• Approximation of the attainable sets of the nonlinear control systems with integral constraint on controls

Cites work

• scientific article; zbMATH DE number 3511136 (Why is no real title available?)
• Approximate volume and integration for basic semialgebraic sets
• Complete search in continuous global optimization and constraint satisfaction
• Convex sets with semidefinite representation
• Flat output characterization for linear systems using polynomial matrices.
• GloptiPoly 3: moments, optimization and semidefinite programming
• Issues in the real-time computation of optimal control
• On convex optimization without convex representation
• Positive polynomials and robust stabilization with fixed-order controllers
• Robust control of polytopic systems by convex optimization
• Robust pole assignment via reflection coefficients of polynomials
• Sufficient and necessary conditions for semidefinite representability of convex hulls and sets
• Sums of squares, moment matrices and optimization over polynomials

Cited in

(3)

• A hierarchy of LMI inner approximations of the set of stable polynomials
• Reduced order \(\mathcal H_\infty\) controller design for vibration control using genetic algorithms
• Simple approximations of semialgebraic sets and their applications to control

Describes a project that uses

Uses Software

• GloptiPoly
• Matlab

This page was built for publication: Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5745606)