Control applications of sum of squares programming

From MaRDI portal





The development in sum of squares programming extended the class of problems that can be solved with convex optimization. These results provide a general methodology to find relaxations solvable by semidefinite programming. The main theorem of the present paper is the Positivstellensatz. Nonlinear systems are considered. The first class of problems is disturbance analysis, three different norms are used to bound the reachable set. The second class is the synthesis of polynomial state feedback controller to enlarge the provable region of attraction. Both classes of problems are demonstrated using two-state nonlinear systems. The methods are illustrated by presenting two proof of concept numerical examples. For the entire collection see [Zbl 1059.93002].




Cited in
(30)


Describes a project that uses

Uses Software






This page was built for publication: Control applications of sum of squares programming

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