Abstract:
In this paper, we propose two new classes of kernel functions (KFs) with hyperbolic barrier terms and define interior-point methods (IPMs) based on these functions to solve linear complementarity problems (LCPs). The two proposed classes have similar forms but are different. One of them is a generalization, up to a multiplicative constant, to the KF recently introduced by Guerdouh et al. (J. Appl. Math. Comput. 1–19 (2023)). According to our analysis, the worst-case iteration complexity of large-update IPMs enjoys the best iteration bound $O (\sqrt {n}\log n \log\frac{n}{\epsilon})$ for large-update methods with special choices of the parameters. This bound coincides with the so far best known complexity results obtained from KFs for LCPs. Finally, some numerical issues regarding the practical performance of the new proposed KFs are reported.
