2
Dept. Applied Mathematics, Shahrekord University
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.
Zangiabadi, M. & Mansouri, H. (2012). Improved infeasible-interior-point algorithm for linear complementarity problems. Bulletin of the Iranian Mathematical Society, 38(3), 787-803.
MLA
Zangiabadi, M., & Mansouri, H. "Improved infeasible-interior-point algorithm for linear complementarity problems", Bulletin of the Iranian Mathematical Society, 38, 3, 2012, 787-803.
HARVARD
Zangiabadi M., Mansouri H. (2012). 'Improved infeasible-interior-point algorithm for linear complementarity problems', Bulletin of the Iranian Mathematical Society, 38(3), pp. 787-803.
CHICAGO
M. Zangiabadi & H. Mansouri, "Improved infeasible-interior-point algorithm for linear complementarity problems," Bulletin of the Iranian Mathematical Society, 38 3 (2012): 787-803,
VANCOUVER
Zangiabadi M., Mansouri H. Improved infeasible-interior-point algorithm for linear complementarity problems. BIMS. 2012;38(3):787-803.
