Role of New Kernel Function in Complexity Analysis of an Interior Point Algorithm for Semi definite Linear Complementarity Problem

arXiv2108.07325MaRDI QIDQ6375384FDOQ6375384

Authors: Nabila Abdessemed, Rachid Benacer, Naima Boudiaf 

Publication date: 16 August 2021

Abstract: In this paper, we introduce a new kernel function which differs from previous functions, and play an important role for generating a new design of primal-dual interior point algorithms for semidefinite linear complementarity problem. Its properties, allow us a great simplicity for the analysis of interior-point method, therefore the complexity of large-update primal-dual interior point is the best so far. Numerical tests have shown that the use of this function gave a big improvement in the results concerning the time and the number of iterations. so is well promising and perform well enough in practice in comparison with some other existing results in the literature.

This page was built for publication: Role of New Kernel Function in Complexity Analysis of an Interior Point Algorithm for Semi definite Linear Complementarity Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6375384)