Generalization of the Theorems of Alternatives in Semidefinite Programming

摘要：

This paper deals with the generalization of the theorems of alternatives in semidefinite programming proposed by Balakrishnan and Vandenberghe.In their original form,the theorems assume that the domain of the linear mapping be a ?nite-dimensional Hilbert space.We show that the validity of the basic theorems does not rely on the finite-dimensional assumption,and the derived theorems can also be appropriately generalized.The Moore-Penrose inverse plays a crucial role in the generalization.

关键词： Semidefinite programming Linear matrix in- equalities Theorems of alternatives Moore-Penrose inverse

作者: Yiping Cheng

作者单位: School of Electronic and Information Engineering Beijing Jiaotong University, Beijing 100044, China

会议类型: 国际会议

会议名称: 2007 IEEE International Conference on Automation and Lofistics

会议地点: 山东济南

会议语种:英文

在线出版日期: 2007-08-18（万方平台首次上网日期，不代表论文的发表时间）