Full Nesterov-Todd step feasible interior-point method for the Cartesian P *()-SCLCP

In this paper, we present a feasible interior-point method (IPM) for the Cartesian P-*()-linear complementarity problem over symmetric cones (SCLCP) that is based on the classical logarithmic barrier function. The method uses Nesterov-Todd search directions and full step updates of iterates. With the appropriate choice of parameters the algorithm generates a sequence of iterates in the small neighbourhood of the central path which implies global convergence of the method. Moreover, this neighbourhood permits the quadratic convergence of the iterates. The iteration complexity of the method is O((1+4)root rlog(r/E)) which matches the currently best known iteration bound for IPMs solving the Cartesian P-*()-SCLCP.