An infeasible path-following algorithm is constructed, and its polynomial complexity is analyzed.

• 基于这组方程，文中建立了一个求解线性互补的不可行内点算法，并分析了它的多项式复杂度。