.png){kind=icon}
.png){kind=icon}
Return
AN INFEASIBLE INTERIOR-POINT ALGORITHM FOR BASED ON A FINITE HYPERBOLIC KERNEL FUNCTION
.png){kind=icon}
PRE
AI
DOI：10.14736/kyb-2026-1-0055.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper concerns an infeasible kernel-based interior-point algorithm (IPA) for monotone linear complementarity problems (LCPs). Our algorithm differs from other existing algorithms in the literature since its feasibility step is induced by a finite hyperbolic barrier term. The convergence analysis shows that the proposed algorithm is well-defined and its complexity bound coincides with the currently best-known iteration bound of infeasible interior-point methods for monotone LCPs. Moreover, the practical performance of our algorithm is validated by some extensive numerical tests. To the best of our knowledge, this is the first full-Newton step infeasible IPA based on a hyperbolic kernel function for solving monotone LCPs.
Keywords:
linear complementarity problems
infeasible interior-point method
kernel function
polynomial complexity
Journal
K
IF:
2.2
Papers:
12
Citations:
978
