TY - JOUR
T1 - A Full-Newton Step Primal-Dual Interior Point Algorithm for Linear Complementarity Problems
AU - Lipu Zhang and Yinghong Xu
JO - Journal of Information and Computing Science
VL - 4
SP - 305
EP - 313
PY - 2024
DA - 2024/01
SN - 5
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22705.html
KW - Horizontal linear complementarity problem, interior-point algorithm, full-Newton step, complexity bound.
AB - <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>