S-variable approach for generic convex polyhedra
Preprint
Abstract
For long the S-variable approach has proved its efficiency for addressing robustness issues with respect to matrix valued bounded, polytopic uncertainties. The results are extended in this paper to generic convex polyhedra thus allowing robustness analysis with respect to unbounded uncertainties. Results apply to rationnaly-dependent models with respect to such polyhedral uncertainties. Moreover the S-variable approach is proved to be enhanced thanks to a new affine rows-decoupled descriptor modeling of such systems. Examples of application of these results are a reinterpretation of the KYP-lemma as well as a reformulation of the links between sum-of-squares approach and the S-variable approach.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- On the Equivalence Between Functionally Affine LPV State-Space Representations and LFT ModelsIEEE Control Systems Letters, 2025
- A Unified Non-Strict Finsler LemmaIEEE Control Systems Letters, 2024
- From Noisy Data to Feedback Controllers: Nonconservative Design via a Matrix S-LemmaIEEE Transactions on Automatic Control, 2020
- S-Variable Approach to LMI-Based Robust Control2015
- LMI stability conditions for uncertain rational nonlinear systemsInternational Journal of Robust and Nonlinear Control, 2013
- Sum-of-Squares Decomposition via Generalized KYP LemmaIEEE Transactions on Automatic Control, 2009
- LMI Tests for Positive Definite Polynomials: Slack Variable ApproachIEEE Transactions on Automatic Control, 2009
- LMI Relaxations in Robust ControlEuropean Journal of Control, 2006
- A new robust -stability condition for real convex polytopic uncertaintySystems & Control Letters, 2000
- Parameterized Polyhedra and Their VerticesInternational Journal of Parallel Programming, 1997