|
Abstract
|
Kernel functions play an important role in defining new search directions
for interior-point algorithms for solving monotone linear complementarity problems.
In this paper we present a new kernel function which yields the complexity bounds
O(√r log r log r
) and O(√r log r
) for large-and small-update methods, respectively,
which are currently the best known bounds for such methods.
|