摘要

In this paper, the monotonicity of conjugate gradient method for the linear cornplementarity problem with S-matrix has been proved. With this property, we propose an algorithm for solving linear complementarity problem with interval data. As far as we know, the monotonicity of this algorithm has not been proved or stated explicit before. Numerical experiments are presented to show the monotonicity of the algorithm and illustrate the efficiency of the new algorithm.