Converse Lyapunov Functions and Converging Inner Approximations to Maximal Regions of Attraction of Nonlinear Systems
Morgan Jones, Matthew M. Peet

TL;DR
This paper introduces a method to approximate the maximal region of attraction for nonlinear ODEs using a sequence of SOS programming problems that converge to the true region, with numerical examples demonstrating effectiveness.
Contribution
It establishes the existence of a converse Lyapunov function for exponentially stable systems and proposes a converging SOS-based approximation method for the maximal region of attraction.
Findings
Sequence of polynomial sublevel sets converges to the maximal region of attraction.
The method provides certifiable inner approximations of the attraction region.
Numerical examples validate the convergence and effectiveness of the approach.
Abstract
This paper considers the problem of approximating the "maximal" region of attraction (the set that contains all asymptotically stable sets) of any given set of locally exponentially stable nonlinear Ordinary Differential Equations (ODEs) with a sufficiently smooth vector field. Given a locally exponential stable ODE with a differentiable vector field, we show that there exists a globally Lipschitz continuous converse Lyapunov function whose 1-sublevel set is equal to the maximal region of attraction of the ODE. We then propose a sequence of d-degree Sum-of-Squares (SOS) programming problems that yields a sequence of polynomials that converges to our proposed converse Lyapunov function uniformly from above in the L1 norm. We show that each member of the sequence of 1-sublevel sets of the polynomial solutions to our proposed sequence of SOS programming problems are certifiably contained…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
