相关论文: Linear Relaxations of Polynomial Positivity for Po…
In this paper, we examine linear programming (LP) relaxations based on Bernstein polynomials for polynomial optimization problems (POPs). We present a progression of increasingly more precise LP relaxations based on expressing the given…
We present a new approach for constructing polytope Lyapunov functions for continuous-time linear switching systems (LSS). This allows us to decide the stability of LSS and to compute the Lyapunov exponent with a good precision in…
The notion of Lyapunov function plays a key role in design and verification of dynamical systems, as well as hybrid and cyber-physical systems. In this paper, to analyze the asymptotic stability of a dynamical system, we generalize standard…
The dynamics of many systems from physics, economics, chemistry, and biology can be modelled through polynomial functions. In this paper, we provide a computational means to find positively invariant sets of polynomial dynamical systems by…
We propose an automatic and formally sound method for synthesising Lyapunov functions for the asymptotic stability of autonomous non-linear systems. Traditional methods are either analytical and require manual effort or are numerical but…
We introduce the concept of sos-convex Lyapunov functions for stability analysis of both linear and nonlinear difference inclusions (also known as discrete-time switched systems). These are polynomial Lyapunov functions that have an…
We consider the problem of constructing Lyapunov functions for linear differential equations with delays. For such systems it is known that exponential stability implies the existence of a positive Lyapunov function which is quadratic on…
Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the…
This thesis settles a number of questions related to computational complexity and algebraic, semidefinite programming based relaxations in optimization and control.
In this paper we employ SMT solvers to soundly synthesise Lyapunov functions that assert the stability of a given dynamical model. The search for a Lyapunov function is framed as the satisfiability of a second-order logical formula, asking…
This article establishes the existence of Lyapunov functions for analyzing the stability of a class of state-constrained systems, and it describes algorithms for their numerical computation. The system model consists of a differential…
This paper presents a proof that existence of a polynomial Lyapunov function is necessary and sufficient for exponential stability of sufficiently smooth nonlinear ordinary differential equations on bounded sets. The main result states that…
We investigate the formal synthesis of global polynomial Lyapunov functions for polynomial vector fields. We establish that a sign-definite polynomial must satisfy specific algebraic constraints, which we leverage to develop a set of…
We consider the stability analysis of a large class of linear 1-D PDEs with polynomial data. This class of PDEs contains, as examples, parabolic and hyperbolic PDEs, PDEs with boundary feedback and systems of in-domain/boundary coupled…
Sum of Squares programming has been used extensively over the past decade for the stability analysis of nonlinear systems but several questions remain unanswered. In this paper, we show that exponential stability of a polynomial vector…
This work studies the problem of searching for homogeneous polynomial Lyapunov functions for stable switched linear systems. Specifically, we show an equivalence between polynomial Lyapunov functions for systems of this class and quadratic…
In this paper, we present an algorithm for stability analysis of systems described by coupled linear Partial Differential Equations (PDEs) with constant coefficients and mixed boundary conditions. Our approach uses positive matrices to…
We consider polynomial differential equations and make a number of contributions to the questions of (i) complexity of deciding stability, (ii) existence of polynomial Lyapunov functions, and (iii) existence of sum of squares (sos) Lyapunov…
This paper studies a class of so-called linear semi-infinite polynomial programming (LSIPP) problems. It is a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are…
This paper studies generalized semi-infinite programs (GSIPs) given by polynomials. We propose a hierarchy of polynomial optimization relaxations to solve them. They are based on Lagrange multiplier expressions and polynomial extensions.…