A New Wide Neighborhood Primal-dual Predictor-corrector Interior-point Algorithm for Linear Optimization
Publish Year: 1400
نوع سند: مقاله کنفرانسی
زبان: English
View: 189
This Paper With 5 Page And PDF and WORD Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICIORS14_180
تاریخ نمایه سازی: 12 دی 1400
Abstract:
We present a new primal-dual predictor-corrector interior-point algorithm for linear optimization problems. In each iteration of this algorithm, we use the new wide neighborhood proposed by Darvay and Takács. Our algorithm computes the predictor direction, then the predictor direction is used to obtain the corrector direction. We show that the duality gap reduces in both predictor and corrector steps. Moreover, we conclude that the complexity bound of this algorithm coincides with the best-known complexity bound obtained for small neighborhood algorithms.
Keywords:
Authors
Hadis Abedi
Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran
Behrouz Kheirfam
Department of Applied Mathematics, Azarbaijan Shahid Madani University, Tabriz, Iran