Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
From MaRDI portal
Publication:5232243
DOI10.1137/17M1121044zbMath1421.90110arXiv1703.05085OpenAlexW2967206311WikidataQ127369854 ScholiaQ127369854MaRDI QIDQ5232243
Victor Magron, Xavier Thirioux, Pierre-Loïc Garoche, Didier Henrion
Publication date: 30 August 2019
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.05085
sums of squaressemidefinite programmingreachable setpolynomial optimizationmoment relaxationsdiscrete-time polynomial systems
Related Items (9)
Convergence of Lasserre's hierarchy: the general case ⋮ A convex optimization approach to dynamic programming in continuous state and action spaces ⋮ Converging outer approximations to global attractors using semidefinite programming ⋮ Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization ⋮ Computing the Hausdorff Boundary Measure of Semialgebraic Sets ⋮ Minimizing Rational Functions: A Hierarchy of Approximations via Pushforward Measures ⋮ Minimum wave speeds in monostable reaction–diffusion equations: sharp bounds by polynomial optimization ⋮ Bounding Extreme Events in Nonlinear Dynamics Using Convex Optimization ⋮ Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient polyhedral enclosures for the reachable set of nonlinear control systems
- Domain of attraction. Analysis and control via SOS programming.
- Set invariance in control
- Convex computation of extremal invariant measures of nonlinear dynamical systems and Markov processes
- Maximal Lyapunov functions and domains of attraction for autonomous nonlinear systems
- Tractable approximations of sets defined with quantifiers
- Global Optimization with Polynomials and the Problem of Moments
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- Semidefinite Approximations of Projections and Polynomial Images of SemiAlgebraic Sets
- Approximate Volume and Integration for Basic Semialgebraic Sets
- Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
- Linear relaxations of polynomial positivity for polynomial Lyapunov function synthesis
- Formal Proofs for Nonlinear Optimization
- Sapo
- Hybrid Systems: Computation and Control
- Inner Approximations for Polynomial Matrix Inequalities and Robust Stability Regions
- Infinite time reachability of state-space regions by using feedback control
- Global qualitative description of a class of nonlinear dynamical systems
This page was built for publication: Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
