Interior-point methods for Cartesian P *(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions

Abstract

An interior-point method (IPM) for Cartesian P *(κ)- linear complementarity problems over symmetric cones (SCLCP) is analysed and the complexity results are presented. The Cartesian P *(κ)- SCLCPs have been recently introduced as the generalization of the more commonly known and more widely used monotone-SCLCPs. The IPM is based on the barrier functions that are defined by a large class of univariate functions called eligible kernel functions, which have recently been successfully used to design new IPMs for various optimization problems. Eligible barrier (kernel) functions are used in calculating the Nesterov–Todd search directions and the default step-size which lead to very good complexity results for the method. For some specific eligible kernel functions, we match the best-known iteration bound for the long-step methods while for the short-step methods the best iteration bound is matched for all cases.