半定规划的一个扰动问题  

Perturbed Problem for Semidefinite Programming

作　　者：岳玉静[1] 王国强[1] 蔡新中[1] 

机构地区：[1]上海工程技术大学高等职业技术学院,上海200437

出　　处：《上海工程技术大学学报》2008年第2期177-179,共3页Journal of Shanghai University of Engineering Science

基　　金：上海市高校选拔培养优秀青年教师科研专项基金资助项目(06XPYQ52)

摘　　要：构造半定规划的一个扰动问题。相比半定规划的标准问题,该扰动问题具有严格可行解。这对于设计和分析半定规划的不可行内点算法具有重要作用。A perturbed problem for semidefinite programming problem was constructed. Compared with the standard problem for semidefinite programming, the perturbed problem has a strictly feasible solution. This was mainly applied to designing and analyzing the infeasible interior-point algorithm for semidefinite programming.

关 键 词：半定规划 扰动问题 原始-对偶内点算法 

分 类 号：O212.2[理学—概率论与数理统计]