Related papers: Linear Programming based Lower Bounds on Average D…
We study systems on time scales that are generalizations of classical differential or difference equations. In this paper we consider linear systems and their small nonlinear perturbations. In terms of time scales and of eigenvalues of…
There are two primary approaches to solving Markov decision problems (MDPs): dynamic programming based on the Bellman equation and linear programming (LP). Dynamic programming methods are the most widely used and form the foundation of both…
In this paper, we present two control laws that are tailored for control applications in which computational and/or communication resources are scarce. Namely, we consider minimum attention control, where the `attention' that a control task…
Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…
This paper considers the problem of finite-time stability for stochastic nonlinear systems. A new Lyapunov theorem of stochastic finite-time stability is proposed, and an important corollary is obtained. Some comparisons with the existing…
In this paper, we deal with the problem of synthesizing static output feedback controllers for stabilizing polynomial systems. Our approach jointly synthesizes a Lyapunov function and a static output feedback controller that stabilizes the…
This paper is concerned with the study of the stability of dynamical systems evolving on time scales. We first {formalize the notion of matrix measures on time scales, prove some of their key properties and make use of this notion to study…
The trapping redundancy of a linear code is the number of rows of a smallest parity-check matrix such that no submatrix forms an $(a,b)$-trapping set. This concept was first introduced in the context of low-density parity-check (LDPC) codes…
Here, we study the ultimately bounded stability of network of mismatched systems using Lyapunov direct method. We derive an upper bound on the norm of the error of network states from its average states, which it achieves in finite time.…
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 letter addresses optimal controller design for periodic linear time-varying systems under unknown-but-bounded disturbances. We introduce differential Lyapunov-type equations to describe time-varying inescapable ellipsoids and define an…
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…
Many learning algorithms are formulated in terms of finding model parameters which minimize a data-fitting loss function plus a regularizer. When the regularizer involves the l0 pseudo-norm, the resulting regularization path consists of a…
In this paper, we consider the stability of discrete-time linear switched systems with a common non-strict Lyapunov matrix.
Solutions to the interval observation problem for delayed impulsive and switched systems with $L_1$-performance are provided. The approach is based on first obtaining stability and $L_1/\ell_1$-to-$L_1/\ell_1$ performance analysis…
We study stability issue of reset and impulsive switched systems. We find time constraints (dwell time and flee time) on switching signals which stabilize a given reset switched system. For a given collection of matrices, we find an…
In this work, we propose novel LMI-based controller synthesis frameworks for periodically time-varying Markov-jump linear systems. We first discuss the necessary conditions for mean square stability and derive Lyapunov-like conditions for…
Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data, the coefficients of an interval program may perturb…
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…
The paper establishes necessary and sufficient conditions for stability of different join-the-shortest-queue models including load-balanced networks with general input and output processes. It is shown, that the necessary and sufficient…