TY - JOUR
ID - 241
TI - Improved infeasible-interior-point algorithm for linear complementarity problems
JO - Bulletin of the Iranian Mathematical Society
JA - BIMS
LA - en
SN - 1017-060X
AU - Zangiabadi, Maryam
AU - Mansouri, Hossein
AD - Dept. Appied Mathematics,
Shahrekord University
AD - Dept. Applied Mathematics, Shahrekord University
Y1 - 2012
PY - 2012
VL - 38
IS - 3
SP - 787
EP - 803
KW - linear complementarity problems
KW - interior-point methods
KW - polynomial complexity
KW - full-Newton steps
KW - search directions
DO -
N2 - 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.
UR - http://bims.iranjournals.ir/article_241.html
L1 - http://bims.iranjournals.ir/article_241_161c4ab48ed9b2e646af66d31fcd932d.pdf
ER -