en Continuous Optimization Continuous Optimization پژوهشی Original <p style="text-align: justify;">In this paper, we propose an arc-search corrector-predictor<br> interior-point method for solving $P_*(kappa)$-linear<br> complementarity problems. The proposed algorithm searches the<br> optimizers along an ellipse that is an approximation of the central<br> path. The algorithm generates a sequence of iterates in the wide<br> neighborhood of central path introduced by Ai and Zhang. The<br> algorithm does not depend on the handicap $kappa$ of the problem,<br> so that it can be used for any $P_*(kappa)$-linear complementarity<br> problem. Based on the ellipse approximation of the central path and<br> the wide neighborhood, we show that the proposed algorithm has<br> $O((1+kappa)sqrt{n}L)$ iteration complexity, the best-known<br> iteration complexity obtained so far by any interior-point method<br> for solving $P_*(kappa)$-linear complementarity problems.</p> <p style="text-align: justify;"></p> Linear complementarity problem, interior-point method, corrector-predictor algorithm, arc search, polynomial complexity. 1 18 http://iors.ir/journal/browse.php?a_code=A-10-430-3&slc_lang=en&sid=1 Behrouz Kheirfam b.kheirfam@azaruniv.edu 00031947532846001519 00031947532846001519 Yes Azarbaijan Shahid Madani University