Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
The authors propose a class of polynomial interior-point algorithms for some horizontal linear complementarity problem based on a parametric kernel function. They analyze the interior-point algorithms using the uniformity of the kernel function. Also they develop some new analysis tools that are used in the complexity analysis of the algorithms and derive the currently best known iteration bounds for the algorithms with large and small update methods are presented.
horizontal linear complementarity problem
scientific article; zbMATH DE number 5612598