A New Predictor–Corrector Interior-Point Method for Linear Complementarity Problems Based on a Wide Neighbourhood
عنوان مقاله: A New Predictor–Corrector Interior-Point Method for Linear Complementarity Problems Based on a Wide Neighbourhood
شناسه ملی مقاله: ICIORS10_029
منتشر شده در دهمین کنفرانس بین المللی انجمن تحقیق در عملیات ایران در سال 1396
شناسه ملی مقاله: ICIORS10_029
منتشر شده در دهمین کنفرانس بین المللی انجمن تحقیق در عملیات ایران در سال 1396
مشخصات نویسندگان مقاله:
M Mohamadi-Sangachin - Departmentof Applied Mathematics, AzarbaijanShahidMadani University
B Kheirfam - Department of Applied Mathematics, Azarbaijan ShahidMadani University
خلاصه مقاله:
M Mohamadi-Sangachin - Departmentof Applied Mathematics, AzarbaijanShahidMadani University
B Kheirfam - Department of Applied Mathematics, Azarbaijan ShahidMadani University
In this paper, we propose a new predictor-corrector interior-point algorithm for solving monotone linear complementarity problem. The algorithm is based on a new class of search directions and the wide neighborhood of the central path. In the corrector step, we derive the step size and the corrector step guarantee that new iterate lies in the wide neighborhood. Then the method enjoys the low iteration bound ofO( nL) , which matches the best obtained one for monotone linear complementarity problems
کلمات کلیدی: linear complementarity problems, predictor-corrector method, wide neighborhood, polynomial complexity
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/766764/