
A class of polynomial interior-point algorithms for the Cartesian P∗(κ)P∗(κ) second-order cone linear complementarity problem
Keywords: عملکرد هسته; 90C33; 90C51Second-order cone linear complementarity problem; Interior-point algorithm; Kernel function; Large- and small-update methods; Iteration bound