摘要
Many problems in mathematical programming can be modelled as semidefinite programming. The success of interior point algorithms for large-scale linear programming has prompted researchers to develop these algorithms to the semidefinite programming (SDP) case. In this paper, we extend Roos’s projective method for linear programming to SDP. The method is path-following and based on the useof a multiplicative barrier function. The iteration bound depends on the choice ofthe exponent μ in the numerator of the barrier function. The analysis in this paper resembles the one of the approximate center method for linear programming, as proposed by Rocs and Vial [14].
Many problems in mathematical programming can be modelled as semidefinite programming. The success of interior point algorithms for large-scale linear programming has prompted researchers to develop these algorithms to the semidefinite programming (SDP) case. In this paper, we extend Roos's projective method for linear programming to SDP. The method is path-following and based on the useof a multiplicative barrier function. The iteration bound depends on the choice ofthe exponent μ in the numerator of the barrier function. The analysis in this paper resembles the one of the approximate center method for linear programming, as proposed by Rocs and Vial [14].
出处
《计算数学》
CSCD
北大核心
1998年第2期175-176,共2页
Mathematica Numerica Sinica
基金
国家自然科学基金!19671041
关键词
半定规划
近似中心
内点法
近似中心投影法
Semidefinite programming, Approximate center, Interiorpoint method