Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations

We generalize a primal-dual interior-point algorithm (IPA) proposed recently in (Illes T, Rigo PR, Torok R Unified approach of primal-dual interior-point algo-rithms for a new class of AET functions, 2022) to P-*(x)-horizontal linear complementarity problems (LCPs) over Cartesian product of symmetric cones. The algorithm is based on the algebraic equivalent transformation (AET) technique with a new class of AET functions. The new class is a modification of the class of AET functions proposed in (Illes T, Rigo PR, Torok R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022) where only two conditions are used as opposed to three used in (Illes T, Rigo PR, Torok R Unified approach of primal-dual interior-point algorithms for a new class of AET functions, 2022). Furthermore, the algorithm is a feasible algorithm that uses full Nesterov-Todd steps, hence, no calculation of step-size is necessary. Nevertheless, we prove that the proposed IPA has the iteration bound that matches the best known iteration bound for IPAs solving these types of problems.