Abstract

<abstract><p>In this paper, we present a predictor-corrector interior-point algorithm for $ P_{*}(\kappa) $-weighted linear complementarity problems. Based on the kernel function $ \varphi(t) = \sqrt{t} $, the search direction of the algorithm is obtained. By choosing appropriate parameters, we prove that the algorithm is feasible and convergent. It is shown that the proposed algorithm has polynomial iteration complexity. Numerical results illustrate the effectiveness of the algorithm.</p></abstract>

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call