A Full-Newton Step Primal-Dual Interior Point Algorithm for Linear Complementarity Problems

Abstract

\u00a0 In \u00a0this \u00a0paper, \u00a0we \u00a0give \u00a0a \u00a0full-Newton \u00a0step \u00a0primal-dual \u00a0interior-point \u00a0algorithm \u00a0for \u00a0monotone horizontal linear complementarity problem. The searching direction is obtained by modification of the classic Newton direction, and which also enjoys the quadratically convergent property in the small neighborhood of $O(2\sqrt{n}{\rm log}\frac{n\mu^0}{\varepsilon})$.