Kernel-Based Interior-Point Methods for Cartesian P*(κ)-LCP over Symmetric Cones

<div class="line" id="line-5"> We present an interior-point method (IPM) for Cartesian P&lowast;(&kappa;)- Linear Complementarity Problems over Symmetric Cones (SCLCPs). The Cartesian P&lowast;(&kappa;)- 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 de&filig;ned 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 leads to very good complexity results for the method. For some speci&filig;c 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.</div>