A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming
العنوان: | A New Strategy in the Complexity Analysis of an Infeasible-Interior-Point Method for Symmetric Cone Programming |
---|---|
المؤلفون: | Yinkui Zhang, Hongwei Liu, Ximei Yang |
المصدر: | Journal of Optimization Theory and Applications. 166:572-587 |
بيانات النشر: | Springer Science and Business Media LLC, 2014. |
سنة النشر: | 2014 |
مصطلحات موضوعية: | Class (set theory), Mathematical optimization, Control and Optimization, Power sum symmetric polynomial, Applied Mathematics, Convergence (routing), Theory of computation, Second-order cone programming, Elementary symmetric polynomial, Management Science and Operations Research, Commutative property, Interior point method, Mathematics |
الوصف: | 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$$xs and $$sx$$sx directions. |
تدمد: | 1573-2878 0022-3239 |
URL الوصول: | https://explore.openaire.eu/search/publication?articleId=doi_________::8ee2e313ee6d30c8ae92251d205f48fa https://doi.org/10.1007/s10957-014-0670-z |
حقوق: | CLOSED |
رقم الأكسشن: | edsair.doi...........8ee2e313ee6d30c8ae92251d205f48fa |
قاعدة البيانات: | OpenAIRE |
تدمد: | 15732878 00223239 |
---|