Related papers: On the Nonexistence of Quadratic Lyapunov Function…
This paper is concerned with the problem of finding a quadratic common Lyapunov function for a family of stable linear systems. We present gradient iteration algorithms which give deterministic convergence for finite system families and…
We present a novel way of generating Lyapunov functions for proving linear convergence rates of first-order optimization methods. Our approach provably obtains the fastest linear convergence rate that can be verified by a quadratic Lyapunov…
We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…
Quadratic Lyapunov functions are prevalent in stability analysis of linear consensus systems. In this paper we show that weighted sums of convex functions of the different coordinates are Lyapunov functions for irreducible consensus…
This paper presents a counterexample-guided iterative algorithm to compute convex, piecewise linear (polyhedral) Lyapunov functions for uncertain continuous-time linear hybrid systems. Polyhedral Lyapunov functions provide an alternative to…
In this paper, we consider linear switched systems $\dot x(t)=A_{u(t)} x(t)$, $x\in\R^n$, $u\in U$, and the problem of asymptotic stability for arbitrary switching functions, uniform with respect to switching ({\bf UAS} for short). We first…
A Path-Complete Lyapunov Function is an algebraic criterion composed of a finite number of functions, called its pieces, and a directed, labeled graph defining Lyapunov inequalities between these pieces. It provides a stability certificate…
We derive converse Lyapunov theorems for input-to-state stability (ISS) of linear infinite-dimensional analytic systems. We show that input-to-state stability of a linear system does not imply existence of a coercive quadratic ISS Lyapunov…
By computing Lyapunov functions of a certain, convenient structure, Lyapunov-based methods guarantee stability properties of the system or, when performing synthesis, of the relevant closed-loop or error dynamics. In doing so, they provide…
Suppose that A and B are real stable matrices, and that their difference A-B is rank one. Then A and B have a common quadratic Lyapunov function if and only if the product AB has no real negative eigenvalue. This result is due to Shorten…
This article investigates the consensus tracking problem of multi-agent systems under jointly connected topology through automated synthesis of Lyapunov functions. Based on the proposed distributed nonlinear control protocol, several…
We consider finite and infinite-dimensional first-order consensus systems with timeconstant interaction coefficients. For symmetric coefficients, convergence to consensus is classically established by proving, for instance, that the usual…
A method for constructing homogeneous Lyapunov functions of degree 1 from polynomial invariant sets is presented for linear time varying systems, homogeneous dynamic systems and the class of nonlinear systems that can be represented as…
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…
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…
Lyapunov functions play a fundamental role in analyzing the stability and convergence properties of optimization methods. In this paper, we propose a novel and straightforward approach for constructing Lyapunov functions for first-order…
Multi-agent coordination algorithms with randomized interactions have seen use in a variety of settings in the multi-agent systems literature. In some cases, these algorithms can be random by design, as in a gossip-like algorithm, and in…
Koopman operator-based methods enable data-driven bilinear representations of unknown nonlinear control systems. Accurate representations often demand significantly higher dimensions than the original system, making control design…
In this paper, a class of abstract dynamical systems is considered which encompasses a wide range of nonlinear finite- and infinite-dimensional systems. We show that the existence of a non-coercive Lyapunov function without any further…
We consider a continuous-time linear time-invariant dynamical system that admits an invariant cone. For the case of a self-dual and homogeneous cone we show that if the system is asymptotically stable then it admits a quadratic Lyapunov…