Finally, according to the bottleneck of Primal-Dual Interior-PointAlgorithm, corresponding solution is given. And the application of this algorithm in the future is prospected.
By using Newton direction and centering direction, we establish a feasible interiorpointalgorithm for monotone linear complementarity problem and show that this method is polynomial in complexity.