Lyapunov Theory for Discrete Time Systems
arXiv:1809.05289
Abstract
In this work, we present the equivalent of many theorems available for continuous time systems. In particular, the theory is applied to Averaging Theory and Separation of time scales. In particular the proofs developed for Averaging Theory and Separation of time scales departs from those typically used in continuous time systems that are based on twice differentiable change of variables and the multiple use of the Implicit Function Theorem and Mean Value Theorem. More specifically, by constructing a suitable Lyapunov function only Lipschitz conditions are necessary. Finally, it is shown that under mild condition on the so-called "interconnection conditions" the proposed tools can guarantee semi-global exponential stability rather than the more stringent local exponential stability typically found in the literature
Cited by in corpus (18)
- Naive Exploration is Optimal for Online LQR
- Tracking-based distributed equilibrium seeking for aggregative games
- A Multistep Lyapunov Approach for Finite-Time Analysis of Biased Stochastic Approximation
- ADMM-Tracking Gradient for Distributed Optimization over Asynchronous and Unreliable Networks
- Newton-Raphson Consensus under asynchronous and lossy communications for peer-to-peer networks
- Almost Surely Stable Deep Dynamics
- ZO-JADE: Zeroth-order Curvature-Aware Multi-Agent Convex Optimization
- Finite-Sample Analysis of Decentralized Temporal-Difference Learning with Linear Function Approximation
- Constraints on OPF Surrogates for Learning Stable Local Volt/Var Controllers
- Convergence Rate Abstractions for Weakly-Hard Real-Time Control
- Fast symplectic integrator for Nesterov-type acceleration method
- Statistical optimality and stability of tangent transform algorithms in logit models
- Investigation of Instabilities in Detumbling Algorithms
- A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm
- Singular Perturbation Theory for a Finite-Dimensional, Discrete-Time Chi Nonlinear System
- A Small-Gain Theorem for Discrete-Time Convergent Systems and Its Applications
- Asymptotic Analysis for Greedy Initialization of Threshold-Based Distributed Optimization of Persistent Monitoring on Graphs
- Local Convergence of Adaptive Gradient Descent Optimizers