Related papers: Learning fixed-complexity polyhedral Lyapunov func…
This paper presents some new propositions related to the fractional order $h$-difference operators, for the case of general quadratic forms and for the polynomial type, which allow proving the stability of fractional order $h$-difference…
In this paper, we describe a lightweight Python framework that provides integrated learning and verification of neural Lyapunov functions for stability analysis. The proposed tool, named LyZNet, learns neural Lyapunov functions using…
We explicitly construct global strict Lyapunov functions for rapidly time-varying nonlinear control systems. The Lyapunov functions we construct are expressed in terms of oftentimes more readily available Lyapunov functions for the limiting…
A sequential piecewise linear programming method is presented where bounded domains of non-convex functions are successively contracted about the solution of a piecewise linear program at each iteration of the algorithm. Although…
In this technical communique, we generalize the well-known Lyapunov-based stabilizability and detectability tests for discrete-time linear time-invariant systems to polytopic linear parameter-varying systems using the class of so-called…
Lyapunov functions provide a tool to analyze the stability of nonlinear systems without extensively solving the dynamics. Recent advances in sum-of-squares methods have enabled the algorithmic computation of Lyapunov functions for…
We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two…
In this paper, we consider the convergence of an abstract inexact nonconvex and nonsmooth algorithm. We promise a pseudo sufficient descent condition and a pseudo relative error condition, which are both related to an auxiliary sequence,…
This paper presents new sufficient conditions for convergence and asymptotic or exponential stability of a stochastic discrete-time system, under which the constructed Lyapunov function always decreases in expectation along the system's…
In this article, we provide a general strategy based on Lyapunov functionals to analyse global asymptotic stability of linear infinite-dimensional systems subject to nonlinear dampings under the assumption that the origin of the system is…
Differential positivity and K-cooperativity, a special case of differential positivity, extend differential approaches to control to nonlinear systems with multiple equilibria, such as switches or multi-agent consensus. To apply this…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
Analysis of transient stability of strongly nonlinear post-fault dynamics is one of the most computationally challenging parts of Dynamic Security Assessment. This paper proposes a novel approach for assessment of transient stability of the…
Neural-based, data-driven analysis and control of dynamical systems have been recently investigated and have shown great promise, e.g. for safety verification or stability analysis. Indeed, not only do neural networks allow for an entirely…
We study path-complete Lyapunov functions, which are stability criteria for switched systems, described by a combinatorial component (namely, an automaton), and a functional component (a set of candidate Lyapunov functions, called the…
We consider the problem of global stability of nonlinear sampled-data systems. Sampled-data systems are a form of hybrid model which arises when discrete measurements and updates are used to control continuous-time plants. In this paper, we…
In this paper we combine two existing approaches for approximating attractors. One of them approximates the attractors arbitrarily well by sublevel sets related to solutions of infinite dimensional linear programming problems. A downside…
In this paper, we extend two classes of functions involved in asymptotic stability analyses. The goal of this extension is to study a maximization problem on the reachable values of a discrete-time dynamical system. This specific…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
Iterative gradient-based optimization algorithms are widely used to solve difficult or large-scale optimization problems. There are many algorithms to choose from, such as gradient descent and its accelerated variants such as Polyak's Heavy…