Computation of polytopic invariants for polynomial dynamical systems using linear programming

DOI10.1016/j.automatica.2012.08.014zbMath1256.93040arXiv1012.1256OpenAlexW2963203019MaRDI QIDQ1932703

Mohamed Amin Ben Sassi, Antoine Girard

Publication date: 21 January 2013

Published in: Automatica (Search for Journal in Brave)

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

zbMATH Keywords

linear programminginvariant setsblossomsLagrangian dualitypolynomial dynamical systemsmulti-affine functionscomputation of polytopic invariants

Mathematics Subject Classification ID

Related Items (9)

A polynomial blossoming approach to stabilization of periodic time-varying systems ⋮ Computation of the maximal invariant set of discrete-time linear systems subject to a class of non-convex constraints ⋮ Observer‐based adaptive controller design for chaos synchronization using Bernstein‐type operators ⋮ Change-of-bases abstractions for non-linear hybrid systems ⋮ Characterization, verification and computation of robust controlled invariants for monotone dynamical systems ⋮ Invariance of a class of semi-algebraic sets for polynomial systems with dynamic compensators ⋮ Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants ⋮ Computation of invariant sets via immersion for discrete-time nonlinear systems ⋮ Polynomial optimization with applications to stability analysis and control -- alternatives to sum of squares

Cites Work

• Unnamed Item
• Unnamed Item
• Box invariance in biologically-inspired dynamical systems
• Unconstrained and constrained global optimization of polynomial functions in one variable
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• Nonlinear systems. Analysis, stability, and control
• New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
• Set invariance in control
• Nonquadratic Lyapunov functions for robust control
• On absolute stability analysis by polyhedral Lyapunov functions
• Squaring the circle: an algorithm for generating polyhedral invariant sets from ellipsoidal ones
• Global Optimization with Polynomials and the Problem of Moments
• Automatic invariant generation for hybrid systems using ideal fixed points
• Computing Differential Invariants of Hybrid Systems as Fixedpoints
• Controlling a Class of Nonlinear Systems on Rectangles
• A Framework for Worst-Case and Stochastic Safety Verification Using Barrier Certificates
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
• Viability theory
• Global qualitative description of a class of nonlinear dynamical systems

This page was built for publication: Computation of polytopic invariants for polynomial dynamical systems using linear programming