Initial Application of SONC to Lyapunov Stability of Dynamical Systems

arXiv2303.02031MaRDI QIDQ6428323FDOQ6428323

Publication date: 3 March 2023

Abstract: Certifying the stability of dynamical systems is a central and challenging task in control theory and systems analysis. To tackle these problems we present an algorithmic approach to finding polynomial Lyapunov functions. Our method relies on sums of nonnegative circuit functions (SONC), a certificate of nonnegativity of real polynomials. We show that both the problem of verifying as well as the more difficult task of finding Lyapunov functions can be carried out via relative entropy programming when using SONC certificates. This approach is analogue yet independent to finding Lyapunov functions via sums of squares (SOS) certificates and semidefinite programming. Furthermore, we explore whether using the related, recently introduced DSONC certificate is advantageous compared to SONC for this type of problem. We implemented our results, and present examples to show their applicability.

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Stability theory for smooth dynamical systems (37C75) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Lyapunov and storage functions (93D30) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Real algebraic and real-analytic geometry (14P99)

This page was built for publication: Initial Application of SONC to Lyapunov Stability of Dynamical Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428323)