Citation:
Abdessemed N, Benacer R, Boudiaf N. A NEW KERNEL FUNCTION GENERATING THE BEST COMPLEXITY ANALYSIS FOR MONOTONE SDLCP. Advances in Mathematics: Scientific Journal [Internet]. 2022;11 (10) :925–941.
Abstract:
In this article, we propose a new class of search directions based on new kernel function to solve the monotone semidefinite linear complementarity problem by primal-dual interior point algorithm. We show that this algorithm based on this function benefits from the best polynomial complexity, namely O( √ n(log n) 2 log n ). The implementation of the algorithm showed a great improvement concerning the time and the number of iterations.