The Lasserre or moment-sum-of-square hierarchy of linear matrix inequality relaxations is used to compute inner approximations of the maximal positively invariant set for continuous-time dynamical systems with polynomial vector fields. Convergence in volume of the hierarchy is proved under a technical growth condition on the average exit time of trajectories. Our contribution is to deal with inner approximations in infinite time, while former work with volume convergence guarantees proposed either outer approximations of the maximal positively invariant set or inner approximations of the region of attraction in finite time
International audienceThis work presents a data-driven method for approximation of the maximum posit...
International audienceLasserre's moment-SOS hierarchy consists of approximating instances of the gen...
This work presents a method to obtain inner and outer approximations of the region of attraction of ...
International audienceThe Lasserre or moment-sum-of-square hierarchy of linear matrix inequality rel...
28 pages, 14 figuresInternational audienceWe consider the problem of approximating numerically the m...
International audienceIn a previous work we developed a convex infinite dimensional linear programmi...
In a previous work we developed a convex infinite dimensional linear program-ming (LP) approach to a...
A shorter version focusing only on the discrete-time case and without the technical proofs appears i...
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through...
The Region of Attraction of an equilibrium point is the set of initial conditions whose trajectories...
International audienceIn this paper, we show that a basic fixed point method used to enclose the gre...
We propose a convex-optimization-based framework for computation of invariant measures of polynomial...
This paper focuses on positive linear time-invariant systems with constant coefficients and specific...
International audienceThis work presents a data-driven method for approximation of the maximum posit...
International audienceLasserre's moment-SOS hierarchy consists of approximating instances of the gen...
This work presents a method to obtain inner and outer approximations of the region of attraction of ...
International audienceThe Lasserre or moment-sum-of-square hierarchy of linear matrix inequality rel...
28 pages, 14 figuresInternational audienceWe consider the problem of approximating numerically the m...
International audienceIn a previous work we developed a convex infinite dimensional linear programmi...
In a previous work we developed a convex infinite dimensional linear program-ming (LP) approach to a...
A shorter version focusing only on the discrete-time case and without the technical proofs appears i...
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through...
The Region of Attraction of an equilibrium point is the set of initial conditions whose trajectories...
International audienceIn this paper, we show that a basic fixed point method used to enclose the gre...
We propose a convex-optimization-based framework for computation of invariant measures of polynomial...
This paper focuses on positive linear time-invariant systems with constant coefficients and specific...
International audienceThis work presents a data-driven method for approximation of the maximum posit...
International audienceLasserre's moment-SOS hierarchy consists of approximating instances of the gen...
This work presents a method to obtain inner and outer approximations of the region of attraction of ...