improved infeasible-interior-point algorithm for linear complementarity problems
improved infeasible-interior-point algorithm for linear complementarity problems
Abstract
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.
Authors and affiliations
- maryam zangiabadi — dept. appied mathematics, shahrekord university
- hossein mansouri — dept. applied mathematics, shahrekord university