|
A Wide Neighborhood Primal-dual Predictor-corrector Interior-point Algorithm with New Corrector Directions for Linear Optimization
|
Hadis Abedi*    ، Behrouz Kheirfam |
| Azarbaijan Shahid Madani University ، hadisa.abd@gmail.com |
|
|
چکیده: (1218 مشاهده) |
| In this paper, 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. Eventually, numerical results show the capability and efficiency of the proposed algorithm. |
|
| |
|
|
متن کامل [PDF 510 kb]
(3529 دریافت)
|
نوع مطالعه: پژوهشی |
موضوع مقاله:
Mathematical Modeling and Applications of OR
دریافت: 1401/8/15 | پذیرش: 1400/9/7 | انتشار: 1400/9/7
|
|
|
|
|
|
|
| ارسال پیام به نویسنده مسئول |
|
|
|
| ارسال نظر درباره این مقاله |
|
|
|
