کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4640166 | 1341264 | 2011 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
We introduce a new kind of kernel function, which yields efficient large-update primal-dual interior-point methods. We conclude that in some situations its iteration bounds are O(m3m+12mnm+12mlognϵ), which are at least as good as the best known bounds so far, O(nlognlognϵ), for large-update primal-dual interior-point methods. The result decreases the gap between the practical behavior of the large-update algorithms and their theoretical performance results, which is an open problem. Numerical results show that the algorithms are feasible.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Computational and Applied Mathematics - Volume 235, Issue 9, 1 March 2011, Pages 2944–2955
Journal: Journal of Computational and Applied Mathematics - Volume 235, Issue 9, 1 March 2011, Pages 2944–2955
نویسندگان
Liying Liu, Shaoyong Li,