Full Text: PDF
DOI: 10.23952/cot.2024.11
Received May 21, 2023; Accepted September 3, 2023; Published online November 11, 2023
Abstract. In this paper, we introduce a new predictor-corrector interior-point algorithm (PC IPA) for solving 
-linear complementarity problems. For the determination of search directions, we use the algebraically equivalent transformation (AET) technique. In this method, we apply the function 
which has inflection point. It is interesting that the kernel corresponding to this AET function is neither self-regular, nor eligible. We present the complexity analysis of the proposed interior-point algorithm and we show that its iteration bound matches the best known iteration bound for this type of PC IPAs given in the literature. It should be mentioned that usually the iteration bound is given for a fixed update and proximity parameter. In this paper, we provide a set of parameters for which the PC IPA is well defined. Moreover, we also show the efficiency of the algorithm by providing numerical results.
How to Cite this Article:
T. Illés, P.R. Rigó, R. Török, New predictor-corrector interior-point algorithm with AET function having inflection points, Commun. Optim. Theory 2024 (2024) 11.