Improved infeasible-interior-point algorithm for linear complementarity problems
چکیده(به انگلیسی؛ چکیدهی فارسی در دسترس نیست)
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.
نویسندگان و وابستگی سازمانی
- Maryam Zangiabadi — Dept. Appied Mathematics, Shahrekord University
- Hossein MansouriORCID 0000-0001-7921-8501 — Dept. Applied Mathematics, Shahrekord University