التفاصيل البيبلوغرافية
| العنوان: |
A wide neighborhood infeasible-interior-point method with arc-search for linear programming. |
| المؤلفون: |
Ximei Yang, Yinkui Zhang, Hongwei Liu |
| المصدر: |
Journal of Applied Mathematics & Computing; Jun2016, Vol. 51 Issue 1/2, p209-225, 17p |
| مستخلص: |
In this paper, we propose an arc-search infeasible-interior-point method for linear programming. The proposed algorithm is based on a wide neighborhood of the central path and searches the optimizers along the ellipses that approximate the entire the central path. We also establish polynomial complexity of the proposed algorithm. Finally, numerical experiments showthat the proposed algorithm is efficient and reliable. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Applied Mathematics & Computing is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| قاعدة البيانات: |
Complementary Index |
Find this article in full text from Springer Verlag. 
Full Text Finder