.png){kind=icon}
.png){kind=icon}
Return
AN IMPROVED DESCENT DIRECTION FOR PATH-FOLLOWING ALGORITHM IN MONOTONE LINEAR COMPLEMENTARITY PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.14736/kyb-2026-1-0035.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present a new full-Newton step feasible interior-point method for solving monotone linear complementarity problems. We derive an efficient search direction by applying an algebraic transformation to the central path system. Furthermore, we prove that the proposed method solves the problem within polynomial time. Notably, the algorithm achieves the best-known iteration bound, namely O(root n log n & varepsilon; )-iterations. Finally, comparative numerical simulations illustrate the effectiveness of the proposed algorithm.
Keywords:
Interior-point method
Monotone linear complementarity problem
Descent direction