An infeasible interior-point algorithm with full-Newton step for linear optimization

Recently, Roos presented a primal–dual infeasible interior-point algorithm that uses full-Newton steps and whose iteration bound coincides with the best known bound for infeasible interior-point algorithms. In the current paper we use a different feasibility step such that the definition of the feasibility step by Mansouri and Roos is a special case of our definition, and show that the same result on the order of iteration complexity can be obtained.