a second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function

In this paper, we present a second-order corrector infeasible interior-point method for linear optimization in a large neighborhood of the central path. the innovation of our method is tocalculate the predictor directions using a specific kernel functioninstead of the logarithmic barrier function. we decompose thepredictor direction induced by the kernel function to two orthogonaldirections of the corresponding to the negative and positivecomponent of the right-hand side vector of the centering equation.the method then considers the new point as a linear combination ofthese directions along with a second-order corrector direction. theconvergence analysis of the proposed method is investigated and itis proved that the complexity bound is 𝒪 (𝑛⅘ log ϵ-1) .