@Article{JICS-5-305,
author = {Lipu Zhang and Yinghong Xu},
title = {A Full-Newton Step Primal-Dual Interior Point Algorithm for Linear Complementarity Problems},
journal = {Journal of Information and Computing Science},
year = {2024},
volume = {5},
number = {4},
pages = {305--313},
abstract = {<p style="text-align: justify;">&nbsp; In &nbsp;this &nbsp;paper, &nbsp;we &nbsp;give &nbsp;a &nbsp;full-Newton &nbsp;step &nbsp;primal-dual &nbsp;interior-point &nbsp;algorithm &nbsp;for &nbsp;monotone 
horizontal linear complementarity problem. The searching direction is obtained by modification of the classic 
Newton direction, and which also enjoys the quadratically convergent property in the small neighborhood of $O(2\sqrt{n}{\rm log}\frac{n\mu^0}{\varepsilon})$.</p>},
issn = {1746-7659},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jics/22705.html}
}