Linear Relaxations of Polynomial Positivity for Polynomial Lyapunov Function Synthesis
IMA Journal of Mathematical Control and Information
We examine linear programming (LP) based relaxations for synthesizing polynomial Lyapunov functions to prove the stability of polynomial ordinary differential equations (ODEs). Our approach starts from a desired parametric polynomial form of the polynomial Lyapunov function. Subsequently, we encode the positive definiteness of the function, and the negation of its derivative, over the domain of interest. We first compare two classes of relaxations for encoding polynomial positivity: relaxations by sum-of-squares (SOS) programmes, against relaxations based on Handelman representations and Bernstein polynomials, that produce linear programmes. Next, we present a series of increasingly powerful LP relaxations based on expressing the given polynomial in its Bernstein form, as a linear combination of Bernstein polynomials. Subsequently, we show how these LP relaxations can be used to search for Lyapunov functions for polynomial ODEs by formulating LP instances. We compare our techniques with approaches based on SOS on a suite of automatically synthesized benchmarks.
Copyright © 2015, the Author(s)
Oxford University Press
Sassi, Mohamed Amin Ben; Sankaranarayanan, Sriram; Chen, Xin; and Ábrahám, Erika, "Linear Relaxations of Polynomial Positivity for Polynomial Lyapunov Function Synthesis" (2016). Computer Science Faculty Publications. 127.