A relaxation of Lyapunov's direct method has been proposed elsewhere that allows for an algorithmic construction of Lyapunov functions to prove stability of equilibria in nonlinear systems, but the search is restricted to systems with polynomial vector fields. In the paper, the above technique is extended to include systems with equality, inequality, and integral constraints. This allows certain non-polynomial nonlinearities in the vector field to be handled exactly and the constructed Lyapunov functions to contain non-polynomial terms. It also allows robustness analysis to be performed. Some examples are given to illustrate how this is done
Abstract: We investigate linear programming relaxations to synthesize Lyapunov functions that es-tab...
Stability analysis of polynomial differential equations is a central topic in nonlinear dynamics and...
Sum of Squares programming has been used extensively over the past decade for the stability analysis...
A relaxation of Lyapunov's direct method has been proposed elsewhere that allows for an algorithmic ...
A relaxation of Lyapunov's direct method has been proposed recently that allows for an algorithmic c...
Summary. Recent advances in semidefinite programming along with use of the sum of squares decomposit...
Recent advances in semidefinite programming along with use of the sum of squares decomposition to ch...
Recent advances in semidefinite programming along with use of the sum of squares decomposition to ch...
Recent advances in semidefinite programming along with use of the sum of squares decomposition to ch...
The sum of squares (SOS) decomposition technique allows numerical methods such as semidefinite progr...
This paper introduces a general framework for analysing nonlinear systems using absolute stability t...
Despite the pervasiveness of sum of squares (sos) techniques in Lyapunov analysis of dynamical syste...
International audienceIn this paper, another step on relaxation for Ta-kagi-Sugeno systems' stabilit...
We propose using (bilinear) sum-of-squares programming for obtaining inner bounds of regions-of-attr...
Abstract—Sum of Squares programming has been used exten-sively over the past decade for the stabilit...
Abstract: We investigate linear programming relaxations to synthesize Lyapunov functions that es-tab...
Stability analysis of polynomial differential equations is a central topic in nonlinear dynamics and...
Sum of Squares programming has been used extensively over the past decade for the stability analysis...
A relaxation of Lyapunov's direct method has been proposed elsewhere that allows for an algorithmic ...
A relaxation of Lyapunov's direct method has been proposed recently that allows for an algorithmic c...
Summary. Recent advances in semidefinite programming along with use of the sum of squares decomposit...
Recent advances in semidefinite programming along with use of the sum of squares decomposition to ch...
Recent advances in semidefinite programming along with use of the sum of squares decomposition to ch...
Recent advances in semidefinite programming along with use of the sum of squares decomposition to ch...
The sum of squares (SOS) decomposition technique allows numerical methods such as semidefinite progr...
This paper introduces a general framework for analysing nonlinear systems using absolute stability t...
Despite the pervasiveness of sum of squares (sos) techniques in Lyapunov analysis of dynamical syste...
International audienceIn this paper, another step on relaxation for Ta-kagi-Sugeno systems' stabilit...
We propose using (bilinear) sum-of-squares programming for obtaining inner bounds of regions-of-attr...
Abstract—Sum of Squares programming has been used exten-sively over the past decade for the stabilit...
Abstract: We investigate linear programming relaxations to synthesize Lyapunov functions that es-tab...
Stability analysis of polynomial differential equations is a central topic in nonlinear dynamics and...
Sum of Squares programming has been used extensively over the past decade for the stability analysis...