A Proof of the Discrete-Time KYP Lemma Using Semidefinite Programming Duality

作     者：Cheng Yiping School of Electronic and Information Engineering Beijing Jiaotong University,Beijing 100044,P.R.China 

会议名称：《第二十六届中国控制会议》

会议日期：2007年

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：supported by the Chinese National Natural Science Foundation under Grant60404010 

关 键 词：Discrete-time KYP lemma Linear matrix inequalities Semidefinite programming Control education 

摘      要：Balakrishnan and Vandenberghe have given an elegant proof of the KYP lemma based on their theorems of alternatives in semidefinite *** also on these theorems,this paper gives a proof of a generalized version of the discrete-time KYP *** 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.