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

We propose a new predictor-corrector (PC) interior-point algorithm (IPA) for solving linear complementarity problem (LCP) with P*(?)-matrices. The introduced IPA uses type of algebraic equivalent transformation (AET) on the centering equations system defining central path. technique was by Darvay and Takács (2018) optimization. search direction discussed in this paper can be derived from positive-asymptotic kernel function using ?(t)=t2 AET. prove that has O((1+4?)nlog3n?04?) iteration complexity, where ? is an upper bound handicap input matrix. To best our knowledge, first PC P*(?)-LCPs which based direction.