Lower bounds on complexity of Lyapunov functions for switched linear systems
From MaRDI portal
Publication:286067
DOI10.1016/J.NAHS.2016.01.003zbMath1382.93028arXiv1504.03761OpenAlexW2964108557MaRDI QIDQ286067
Amir Ali Ahmadi, Raphaël M. Jungers
Publication date: 19 May 2016
Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.03761
convex optimization for Lyapunov analysislinear difference inclusionsstability of switched systemsthe finiteness conjecture of the joint spectral radius
Related Items (6)
Lower bounds on complexity of Lyapunov functions for switched linear systems ⋮ Robust \(H_\infty\) finite-time control for discrete-time polytopic uncertain switched linear systems ⋮ On random walks and switched random walks on homogeneous spaces ⋮ Counterexample-guided computation of polyhedral Lyapunov functions for piecewise linear systems ⋮ Polynomial Norms ⋮ Robust stability of polytopic time-inhomogeneous Markov jump linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds on complexity of Lyapunov functions for switched linear systems
- Non-weighted quasi-time-dependent \(H_\infty\) filtering for switched linear systems with persistent dwell-time
- An explicit counterexample to the Lagarias-Wang finiteness conjecture
- Algebraic unsolvability of problem of absolute stability of desynchronized systems
- Simultaneous stabilizability of three linear systems is rationally undecidable
- The finiteness conjecture for the generalized spectral radius of a set of matrices
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Undecidable problems for probabilistic automata of fixed dimension
- Switching in systems and control
- The boundedness of all products of a pair of matrices is undecidable
- Stability of discrete linear inclusion
- On absolute stability analysis by polyhedral Lyapunov functions
- On the finiteness property for rational matrices
- Efficient algorithms for deciding the type of growth of products of integer matrices
- Approximation of the joint spectral radius using sum of squares
- Graph diameter, eigenvalues, and minimum-time consensus
- A new decision method for elementary algebra
- Asymptotic height optimization for topical IFS, Tetris heaps, and the finiteness conjecture
- Analysis of the joint spectral radius via lyapunov functions on path-complete graphs
- Common Polynomial Lyapunov Functions for Linear Switched Systems
- Lyapunov function construction by linear programming
- Simultaneous Contractibility
- An Elementary Counterexample to the Finiteness Conjecture
- Dynamical systems which undergo switching
- On common quadratic Lyapunov functions for stable discrete-time LTI systems
- Semidefinite Optimization and Convex Algebraic Geometry
- On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms
- Persistent Dwell-Time Switched Nonlinear Systems: Variation Paradigm and Gauge Design
- Conjugate Convex Lyapunov Functions for Dual Linear Differential Inclusions
- Stability Criteria for Switched and Hybrid Systems
- Joint Spectral Radius and Path-Complete Graph Lyapunov Functions
- Set-theoretic methods in control
This page was built for publication: Lower bounds on complexity of Lyapunov functions for switched linear systems
