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

2010/08/15 by Alexandre Megretski, Megretski, Alexandre
Computer Science · Mathematics · #FOS: Mathematics #Matrix Theory and Algorithms #Numerical methods in inverse problems #Optimization and Control (math.OC) #Optimization and Variational Analysis #math.OC

paper · pdf · doi:10.48550/arxiv.1008.2552

24 pages

arxiv created 2010/08/15 · openalex publication_date 2010/08/15 · arxiv updated 2010/08/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Several variations of the classical Kalman-Yakubovich-Popov Lemma, as well the associated minimax theorem are presented.

Related

• A further improvement of a minimax theorem of Borenshtein and Shulman
• Kelley's Theorem and Some Related Results
• Von Neumann's minimax theorem through Fourier-Motzkin elimination
• On a minimax theorem: an improvement, a new proof and an overview of its applications
• Remarks on Pseudo-continuity