Title :
A Proof of the Discrete-Time KYP Lemma Using Semidefinite Programming Duality
Author_Institution :
Beijing Jiaotong Univ., Beijing
Abstract :
Balakrishnan and Vandenberghe have given an elegant proof of the KYP lemma based on their theorems of alternatives in semidefinite programming. Based also on these theorems, this paper gives a proof of a generalized version of the discrete-time KYP lemma. In addition, we point out that in the nonstrict case of Balakrishnan and Vandenberghe´s (continuous-time) KYP formulation the hypothesis that M22 be positive semidefinite can be dropped.
Keywords :
discrete time systems; linear matrix inequalities; Balakrishnan case; Vandenberghe case; discrete-time KYP lemma; semidefinite programming duality; Control theory; Educational programs; Eigenvalues and eigenfunctions; Electronic mail; Frequency; Linear algebra; Linear matrix inequalities; Linear programming; Programming profession; Control education; Discrete-time KYP lemma; Linear matrix inequalities; Semidefinite programming;
Conference_Titel :
Control Conference, 2007. CCC 2007. Chinese
Conference_Location :
Hunan
Print_ISBN :
978-7-81124-055-9
Electronic_ISBN :
978-7-900719-22-5
DOI :
10.1109/CHICC.2006.4347309
