Self-Dual Embedding for SDP Using ELSD and Its Lagrangian Dual

摘要：

This paper is devoted to the study of an embedding method for semidefinite programming problems using Extended Lagrange-Slater dual (ELSD) and its Lagrangian dual. A theorem proved by de Klerk et al. in 1996 is revisited. A new proof is provided utilizing a result regarding the weak feasibility of a conic linear programming problem.

关键词： Semidefinite programming Embedding methods Extended Lagrange-Slater dual Interior-point methods

作者: Qinghong Zhang Gang Chen Ting Zhang

作者单位: Department of Mathematics and Computer Science Northern Michigan University Marquette,MI 49855,USA Department of Mathematics Nantong Vocational College Nantong,226007,P.R.China

会议类型: 国际会议

会议名称: The Third International Joint Conference on Computational Science and Optimization(第三届计算科学与优化国际大会 CSO 2010)

会议地点: 黄山

会议语种:英文

页码: 25-29

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