The curvature integral nad the complexity of linear complementarity problems

In this paper, the authors propose a predictor-corrector-type algorithm for solving the linear complemtnarity problem (LCP), and prove that the actual number of iterations needed by the algorithm is bounded from above and from below by a curvature integral along the central trajectory of the problem. This curvature integral is not greater than, possibly smaller than, the best upper bound obtained in the literature to date.