%0 Journal Article %T Improved infeasible-interior-point algorithm for linear complementarity problems %J Bulletin of the Iranian Mathematical Society %I Iranian Mathematical Society (IMS) %Z 1017-060X %A Zangiabadi, Maryam %A Mansouri, Hossein %D 2012 %\ 09/15/2012 %V 38 %N 3 %P 787-803 %! Improved infeasible-interior-point algorithm for linear complementarity problems %K linear complementarity problems %K interior-point methods %K polynomial complexity %K full-Newton steps %K search directions %R %X We present a modified version of the infeasible-interior- We present a modified version of the infeasible-interior-point algorithm for monotone linear complementary problems introduced by Mansouri et al. (Nonlinear Anal. Real World Appl. 12(2011) 545--561). Each main step of the algorithm consists of a feasibility step and several centering steps. We use a different feasibility step, which targets at the $mu^+$-center. It results a better iteration bound. %U http://bims.iranjournals.ir/article_241_161c4ab48ed9b2e646af66d31fcd932d.pdf