Related papers: Polyhedral Lyapunov Functions with Fixed Complexit…
In this note, we study monotone dynamical systems with respect to polyhedral cones. Using the half-space representation and the vertex representation, we propose three equivalent conditions to certify monotonicity of a dynamical system with…
Stability of stationary solutions of parabolic equations is conventionally studied by linear stability analysis, Lyapunov functions or lower and upper functions. We discuss here another approach based on differential inequalities written…
Fixed-time stable dynamical systems are capable of achieving exact convergence to an equilibrium point within a fixed time that is independent of the initial conditions of the system. This property makes them highly appealing for designing…
This paper presents an efficient, offline method to simultaneously synthesize controllers and seek closed-loop Lyapunov functions for constrained piecewise affine systems on triangulated subsets of the admissible states. Triangulation…
Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a…
The topic of this manuscript is the stability analysis of continuous-time switched nonlinear systems with constraints on the admissible switching signals. Our particular focus lies in considering signals characterized by upper and lower…
For solving constrained (pseudo)-monotone variational inequality, we prove that the upper bound of stepsize $\frac{1}{2L}$ established for the Popov's algorithm and the forward-reflected-backward algorithm is tight. For unconstrained case,…
The Lyapunov exponent is used to characterize the stability of the dynamic response of the system, and it is often employed to verify if a system is chaotic. Since its discovery in the nineteenth century, various methods have been proposed…
Controller design for nonlinear systems with Control Lyapunov Function (CLF) based quadratic programs has recently been successfully applied to a diverse set of difficult control tasks. These existing formulations do not address the gap…
This paper considers a sampling-based approach to stability verification for piecewise continuous nonlinear systems via Lyapunov functions. Depending on the system dynamics, the candidate Lyapunov function and the set of initial states of…
This paper presents an algorithm for computing inner estimates of the regions of attraction of limit cycles of a nonlinear hybrid system. The basic procedure is: (1) compute the dynamics of the system transverse to the limit cycle; (2) from…
We consider a generalisation of Ulam's method for approximating invariant densities of one-dimensional chaotic maps. Rather than use piecewise constant polynomials to approximate the density, we use polynomials of degree n which are defined…
Automating the solutions of multiple network information theory problems, stretching from fundamental concerns such as determining all information inequalities and the limitations of linear codes, to applied ones such as designing coded…
A delay Lyapunov matrix corresponding to an exponentially stable system of linear time-invariant delay differential equations can be characterized as the solution of a boundary value problem involving a matrix valued delay differential…
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 solve a maximization problem where the objective function is quadratic and the constraints set is the reachable values set of a stable discrete-time affine system. This problem is equivalent to solve an infinite number of…
We study convergence of nonlinear systems in the presence of an `almost Lyapunov' function which, unlike the classical Lyapunov function, is allowed to be nondecreasing---and even increasing---on a nontrivial subset of the phase space.…
In this study, we propose new global stabilization approaches for a class of polynomial systems in both model-based and data-driven settings. The existing model-based approach guarantees global asymptotic stability of the closed-loop system…
The development of finite/fixed-time stable optimization algorithms typically involves study of specific problem instances. The lack of a unified framework hinders understanding of more sophisticated algorithms, e.g., primal-dual gradient…
Convex polyhedra are the basis for several abstractions used in static analysis and computer-aided verification of complex and sometimes mission critical systems. For such applications, the identification of an appropriate…