Exploring complexity of large update interior-point methods for P∗(κ) linear complementarity problem based on Kernel function

Interior-point methods not only are the most effective methods in practice but also have polynomial-time complexity. The large update interior-point methods perform in practice much better than the small update methods which have the best known theoretical complexity. In this paper, motivated by the complexity results for linear optimization based on kernel functions, we extend a generic primal-dual interior-point algorithm based on a new kernel function to solve P∗(κ) linear complementarity problems. By using some elegant and simple tools and having interior-point condition, we show that the large update primal-dual interior-point methods for solving P∗(κ) linear complementarity problems enjoys Oq(1+2κ)n(logn)q+1qlognε iteration bound which becomes O(1+2κ)nlognlog(logn)lognε with special choices of the parameter q. This bound is much better than the classical primal-dual interior-point methods based on logarithmic barrier function and recent kernel functions introduced by some authors in optimization field. Some computational results have been provided.