论文部分内容阅读
This paper presents an infeasible-interior-point algorithm for aclass of nonmonotone complementarity problems, and analyses its convergence and computational complexity. The results indicate that the proposed algorithm is a polynomial-time one.