Converging outer approximations to global attractors using semidefinite programming
From MaRDI portal
Abstract: This paper develops a method for obtaining guaranteed outer approximations for global attractors of continuous and discrete time nonlinear dynamical systems. The method is based on a hierarchy of semidefinite programming problems of increasing size with guaranteed convergence to the global attractor. The approach taken follows an established line of reasoning, where we first characterize the global attractor via an infinite dimensional linear programming problem (LP) in the space of Borel measures. The dual to this LP is in the space of continuous functions and its feasible solutions provide guaranteed outer approximations to the global attractor. For systems with polynomial dynamics, a hierarchy of finite-dimensional sum-of-squares tightenings of the dual LP provides a sequence of outer approximations to the global attractor with guaranteed convergence in the sense of volume discrepancy tending to zero. The method is very simple to use and based purely on convex optimization. Numerical examples with the code available online demonstrate the method.
Recommendations
- A converse sum of squares Lyapunov function for outer approximation of minimal attractor sets of nonlinear systems
- Bounding extrema over global attractors using polynomial optimisation
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Domain of attraction. Analysis and control via SOS programming.
- Convex computation of the maximum controlled invariant set for polynomial control systems
Cites work
- Bounds on mean energy in the Kuramoto–Sivashinsky equation computed using semidefinite programming
- Computing controlled invariant sets from data using convex optimization
- Computing sum of squares decompositions with rational coefficients
- Convergence rates of moment-sum-of-squares hierarchies for optimal control problems
- Convex computation of the maximum controlled invariant set for polynomial control systems
- Convex Computation of the Region of Attraction of Polynomial Control Systems
- Generalized Curves and Extremal Points
- Global optimization with polynomials and the problem of moments
- GloptiPoly 3: moments, optimization and semidefinite programming
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 1787316 (Why is no real title available?)
- Infinite-dimensional dynamical systems. An introduction to dissipative parabolic PDEs and the theory of global attractors
- Nonlinear Control Synthesis by Convex Optimization
- Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations
- Positive trigonometric polynomials and signal processing applications
- Review on computational methods for Lyapunov functions
- Semidefinite Approximations of Reachable Sets for Discrete-time Polynomial Systems
- Stabilization of continuous-time linear systems subject to input quantization
- {\textsc{RealCertify}}: a Maple package for certifying non-negativity
Cited in
(11)- Polynomial level-set method for attractor estimation
- A converse sum of squares Lyapunov function for outer approximation of minimal attractor sets of nonlinear systems
- Finding positively invariant sets and proving exponential stability of limit cycles using sum-of-squares decompositions
- Bounding extrema over global attractors using polynomial optimisation
- Auxiliary functions as Koopman observables: data-driven analysis of dynamical systems via polynomial optimization
- Koopman and Perron-Frobenius operators on reproducing kernel Banach spaces
- Peak estimation of rational systems using convex optimization
- Convergence rates for the moment-SoS hierarchy
- Polynomial optimization for nonlinear dynamics: theory, algorithms and applications. Abstracts from the workshop held July 28 -- August 2, 2024
- Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
- Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations
This page was built for publication: Converging outer approximations to global attractors using semidefinite programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2665706)
