A New Full-NT-Step Infeasible Interior-Point Algorithm for SDP Based on a Specific Kernel Function  

作　　者：Samir Bouali Samir Kabbaj 

机构地区：[1]Department of Mathematics and Informatics, Faculty of Sciences, University Ibn Tofail, Kenitra, Morocco

出　　处：《Applied Mathematics》2012年第9期1014-1022,共9页应用数学（英文）

摘　　要：In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.

关 键 词：SEMIDEFINITE Programming Full Nesterov-Todd STEPS Infeasible INTERIOR-POINT Methods POLYNOMIAL Complexity KERNEL Functions 

分 类 号：O1[理学—数学]