A new polynomial time method for a linear complementarity problem

The purpose of this paper is to present a new polynomial time method for a linear complementarity problem with a positive semi-definite matrix. The method follows a sequence of points. If the sequence on a path is generated, a path following method can be constructed, and if the sequence based on a potential function is generated, a potential reduction method can be constructed. The method has the advantage that it requires at most iterations for any initial feasible point whose components lie between and .