Related papers: Gradient algorithms for finding common Lyapunov fu…
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…
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…
Motivated by applications to distributed optimization over networks and large-scale data processing in machine learning, we analyze the deterministic incremental aggregated gradient method for minimizing a finite sum of smooth functions…
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…
We provide algorithms for computing a Lyapunov function for a class of systems where the state trajectories are constrained to evolve within a closed convex set. The dynamical systems that we consider comprise a differential equation which…
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 provide an example proving that there exists no quadratic Lyapunov function for a certain class of linear agreement/consensus algorithms, a fact that had been numerically verified in [5]. We also briefly discuss sufficient conditions for…
Gradient algorithms are classical in adaptive control and parameter estimation. For instantaneous quadratic cost functions they lead to a linear time-varying dynamic system that converges exponentially under persistence of excitation…
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…
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…
In this paper, we develop a unified framework able to certify both exponential and subexponential convergence rates for a wide range of iterative first-order optimization algorithms. To this end, we construct a family of parameter-dependent…
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…
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…
Stability margins for linear time-varying (LTV) and switched-linear systems are traditionally computed via quadratic Lyapunov functions, and these functions certify the stability of the system under study. In this work, we show how the more…
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…
We present a new algorithm for computing the Lyapunov exponents spectrum based on a matrix differential equation. The approach belongs to the so called continuous type, where the rate of expansion of perturbations is obtained for all times,…
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…
We consider a class of linear differential operators acting on vector-valued function spaces with general coupled boundary conditions. Unlike in the more usual case of so-called quantum graphs, the boundary conditions can be nonlinear.…
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 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…