التفاصيل البيبلوغرافية
| العنوان: |
A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming |
| المؤلفون: |
Ximei Yang, Hongwei Liu, Yinkui Zhang |
| المصدر: |
Springer, Journal of Optimization Theory and Applications. 166(2):572-587 |
| سنة النشر: |
2015 |
| الوصف: |
In this paper, we give a new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming. Using the strategy, we improve the theoretical complexity bound of an infeasible-interior-point method. Convergence is shown for a commutative class of search directions, which includes the Nesterov–Todd direction and the $$xs$$ x s and $$sx$$ s x directions. |
| نوع الوثيقة: |
redif-article |
| اللغة: |
English |
| DOI: |
10.1007/s10957-014-0670-z |
| الإتاحة: |
https://ideas.repec.org/a/spr/joptap/v166y2015i2d10.1007_s10957-014-0670-z.html |
| رقم الأكسشن: |
edsrep.a.spr.joptap.v166y2015i2d10.1007.s10957.014.0670.z |
| قاعدة البيانات: |
RePEc |
