Improved infeasible-interior-point algorithm for linear complementarity problems

Document Type : Research Paper


1 Dept. Appied Mathematics, Shahrekord University

2 Dept. Applied Mathematics, Shahrekord University


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.


Main Subjects