Predictor-corrector interior-point algorithm for <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.svg"><mml:mrow><mml:msub><mml:mi>P</mml:mi><mml:mo>*</mml:mo></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>κ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:math>-linear complementarity problems based on a new type of algebraic equivalent transformation technique
Zsolt Darvay, Tibor Illés, Petra Renáta Rigó
Abstract
We propose a new predictor-corrector (PC) interior-point algorithm (IPA) for solving linear complementarity problem (LCP) with P*(κ)-matrices. The introduced IPA uses a new type of algebraic equivalent transformation (AET) on the centering equations of the system defining the central path. The new technique was introduced by Darvay and Takács (2018) for linear optimization. The search direction discussed in this paper can be derived from positive-asymptotic kernel function using the function φ(t)=t2 in the new type of AET. We prove that the IPA has O((1+4κ)nlog3nμ04ϵ) iteration complexity, where κ is an upper bound of the handicap of the input matrix. To the best of our knowledge, this is the first PC IPA for P*(κ)-LCPs which is based on this search direction.