INTERIOR-POINT METHODS FOR SUFFICIENT HORIZONTAL LINEAR COMPLEMENTARITY PROBLEMS

In this paper we present two (new) feasible and infeasible interior-point methods (IPMs) for solving sufficient horizontal linear complementarity problem (HLCP). We prove that our feasible and infeasible methods have O( p n(1+·) log n " ) and O((1+·)n log maxfjjr0jj;(x0)T s0g " ) iteration complexity, respectively, that coincide with the best iteration bounds for solving sufficient HLCP