A New Polynomial Interior-Point Algorithm for Monotone Linear Complementarity Problem Based on a Kernel Function
【摘要】：正In this paper, we present a new polynomial interior-point algorithm for monotone linear complementarity problem based on a kernel function. The proposed function is defined by some more efficient easy to check and mild conditions. These properties enable us to improve the polynomial complexity bound of large-update interior-point method to O((?)log n log n/ε), which is the currently best known complexity bound for the algorithm with large-update method.