Article citationsMore>>

H. Mansouri and C. Roos, “Simplified O(nL) Infeasible Interior-Point Algorithm for Linear Optimization Using Full-Newton Steps,” Optimization Methods and Software, Vol. 22, No. 3, 2007, pp. 519-530. doi:10.1080/10556780600816692

has been cited by the following article:

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

  AUTHORS: Samir Bouali, Samir Kabbaj

  KEYWORDS: Semidefinite Programming; Full Nesterov-Todd Steps; Infeasible Interior-Point Methods; Polynomial Complexity; Kernel Functions

  JOURNAL NAME: Applied Mathematics, Vol.3 No.9, September 27, 2012

  ABSTRACT: 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.