Generalized S-procedure and finite frequency KYP lemma
By Tetsuya Iwasaki, G. Meinsma, M. Fu. 2000
206 citations recorded by the source corpus.
The contribution of this paper is twofold. First we give a generalization of the S-procedure which has been proven useful for robustness analysis of control systems. We then apply the generalized S-procedure to derive an extension of the Kalman – Yakubovich – Popov lemma that converts a frequency domain condition within a finite interval to a linear matrix inequality condition suitable for numerical computations.
Subfields: Artificial Intelligence, Computational Theory and Mathematics, Control and Systems Engineering
View Paper: https://www.semanticscholar.org/paper/eda44f3b7325d3af99a47489011e298390b28443
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Computational Theory and Mathematics
In Control and Systems Engineering
Citations in the corpus
- Bootstrapping mixed correlators in the 3D Ising model (2014, unknown): “37), can be written as [48–50] a(x) + xb(x), (2.”
- From Noisy Data to Feedback Controllers: Nonconservative Design via a Matrix S-Lemma (2020, background): “A generalized S-lemma involving more general types of multipliers was considered in [44], [45], and was shown to be non-conservative under extra assumptions.”