کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9662352 | 698776 | 2005 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A self-adjusting interior point algorithm for linear complementarity problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Based on the min-max principle, the standard centering equation in the interior point method is replaced by the optimality condition of a new proximity measure function. Thus, a self-adjusting mechanism is constructed in the new perturbed system. The Newton direction can be adjusted self-adaptively according to the information of last iterates. A self-adjusting interior point method is given based on the new perturbed system. Numerical comparison is made between this algorithm and a primal-dual interior point algorithm using “standard” perturbed system. Results demonstrate the efficiency and some advantages of the proposed algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Mathematics with Applications - Volume 50, Issues 1â2, July 2005, Pages 33-40
Journal: Computers & Mathematics with Applications - Volume 50, Issues 1â2, July 2005, Pages 33-40
نویسندگان
Suyan He, Xingsi Li, Shaohua Pan,