KYP Lemma for Non-Strict Inequalities and the associated Minimax Theorem
Alexandre Megretski

TL;DR
This paper extends the classical KYP Lemma to non-strict inequalities and explores the related minimax theorem, broadening the theoretical framework for control and optimization problems.
Contribution
It introduces new variations of the KYP Lemma applicable to non-strict inequalities and discusses their implications for the associated minimax theorem.
Findings
Extended KYP Lemma for non-strict inequalities
New theoretical insights into the minimax theorem
Broadened applicability in control theory
Abstract
Several variations of the classical Kalman-Yakubovich-Popov Lemma, as well the associated minimax theorem are presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Variational Analysis · Numerical methods in inverse problems · Matrix Theory and Algorithms
