Related papers: Convex Optimization methods for computing the Lyap…
In this work, we give a rigorous explicit formula for the Lyapunov exponent for some binary infinite products of random $2\times 2$ real matrices. All these products are constructed using only two types of matrices, $A$ and $B$, which are…
We present a methodology for establishing the existence of quadratic Lyapunov inequalities for a wide range of first-order methods used to solve convex optimization problems. In particular, we consider i) classes of optimization problems of…
This article presents a novel numerically tractable technique for synthesizing Lyapunov functions for equilibria of nonlinear vector fields. In broad strokes, corresponding to an isolated equilibrium point of a given vector field, a…
The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…
We calculate analytically the largest Lyapunov exponent of the so-called $\alpha XY$ Hamiltonian in the high energy regime. This system consists of a $d$-dimensional lattice of classical spins with interactions that decay with distance…
We give lower and upper bounds on both the Lyapunov exponent and generalised Lyapunov exponents for the random product of positive and negative shear matrices. These types of random products arise in applications such as fluid stirring…
We study the top Lyapunov exponents of random products of positive $2 \times 2$ matrices and obtain an efficient algorithm for its computation. As in the earlier work of Pollicott, the algorithm is based on the Fredholm theory of…
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…
This paper introduces a second-order differential inclusion for unconstrained convex optimization. In continuous level, solution existence in proper sense is obtained and exponential decay of a novel Lyapunov function along with the…
Lyapunov exponents measure the average exponential growth rate of typical linear perturbations in a chaotic system, and the inverse of the largest exponent is a measure of the time horizon over which the evolution of the system can be…
We introduce a novel approach addressing global analysis of a difficult class of nonconvex-nonsmooth optimization problems within the important framework of Lagrangian-based methods. This genuine nonlinear class captures many problems in…
The aim of this paper is to shed more light on some recent ideas about Lyapunov exponents and clarify the formal structures behind these ideas. In particular, we show that the vector of (averaged) Lyapunov exponents of a smooth…
We use Lyapunov-like functions and convex optimization to propagate uncertainty in the initial condition of nonlinear systems governed by ordinary differential equations. We consider the full nonlinear dynamics without approximation,…
We show that a common Lyapunov matrix exists for the convex combination of two Hurwitz matrices if and only if the intersection of the set of strict Lyapunov matrices for one matrix and the set of non-strict Lyapunov matrices for the other…
For cooperative random linear systems of ordinary differential equations a method is presented of obtaining lower estimates of the top Lyapunov exponent. The proofs are based on applying some polynomial Lyapunov-like function. Known…
This paper studies the continuous-time dynamics of primal-dual algorithms for linearly constrained convex optimization problems and provides a quantitative convergence analysis using the Lyapunov functions. With the growing prevalence of…
We develop a powerful and general method to provide rigorous and accurate upper and lower bounds for Lyapunov exponents of stochastic flows. Our approach is based on computer-assisted tools, the adjoint method and established results on the…
Let $f:\mathbb{R}^n \to \mathbb{R}$ be a continuously differentiable convex function with its minimizer denoted by $x_*$ and optimal value $f_* = f(x_*)$. Optimization algorithms such as the gradient descent method can often be interpreted…
We discuss several techniques for the evaluation of the generalised Lyapunov exponents which characterise the growth of products of random matrices in the large-deviation regime. A Monte Carlo algorithm that performs importance sampling…
This paper is devoted to the study of acceleration methods for an inequality constrained convex optimization problem by using Lyapunov functions. We first approximate such a problem as an unconstrained optimization problem by employing the…