Role of New Kernel Function in Complexity Analysis of an Interior Point Algorithm for Semi definite Linear Complementarity Problem
Numerical Analysis
2021-08-18 v1 Numerical Analysis
Optimization and Control
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.
Cite
@article{arxiv.2108.07325,
title = {Role of New Kernel Function in Complexity Analysis of an Interior Point Algorithm for Semi definite Linear Complementarity Problem},
author = {Nabila Abdessemed and Rachid Benacer and Naima Boudiaf},
journal= {arXiv preprint arXiv:2108.07325},
year = {2021}
}
Comments
19 pages, 0 figures