<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Abdessemed, Nabila</style></author><author><style face="normal" font="default" size="100%">Benacer, Rachid</style></author><author><style face="normal" font="default" size="100%">Boudiaf, Naima</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A NEW KERNEL FUNCTION GENERATING THE BEST COMPLEXITY ANALYSIS FOR MONOTONE SDLCP</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Mathematics: Scientific Journal</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2022</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://research-publication.com/amsj/uploads/papers/vol-11/iss-10/AMSJ-2022-N10-09.pdf</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">11</style></volume><pages><style face="normal" font="default" size="100%">925–941</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p style=&quot;text-align: justify;&quot;&gt;
	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 polynomial complexity, namely O( √ n(log n) 2 log n  ). The implementation of the algorithm showed a great improvement concerning the time and the number of iterations.
&lt;/p&gt;
</style></abstract><issue><style face="normal" font="default" size="100%">10</style></issue></record></records></xml>