Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones

We present an interior-point method for monotone linear complementarity problems over symmetric cones (SCLCP) that is based on barrier functions which are defined by a large class of univariate functions, called eligible kernel functions. This class is fairly general and includes the classical logarithmic function, the self-regular functions, as...

Unified Analysis of Kernel-Based Interior-Point Methods for P?(?)-Linear Complementarity Problems

We present an interior-point method for the P?(?)-linear complementarity problem (LCP) that is based on barrier functions which are defined by a large class of univariate functions called eligible kernel functions. This class is fairly general and includes the classical logarithmic function and the self-regular functions, as well as many non...