پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 158 |
| تعداد شماره‌ها | 6,230 |
| تعداد مقالات | 67,766 |
| تعداد مشاهده مقاله | 115,219,050 |
| تعداد دریافت فایل اصل مقاله | 89,965,702 |
A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem | ||
| Journal of Sciences, Islamic Republic of Iran | ||
| مقاله 6، دوره 23، شماره 3، آذر 2012، صفحه 237-244 اصل مقاله (430.62 K) | ||
| نویسنده | ||
| H. Mansouri | ||
| Department of Applied Mathematics, Faculty of Mathematical Sciences, Shahrekord University, | ||
| چکیده | ||
| In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue. | ||
| عنوان مقاله [English] | ||
| A Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem | ||
| نویسندگان [English] | ||
| H. Mansouri | ||
| چکیده [English] | ||
| In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue. | ||
|
آمار تعداد مشاهده مقاله: 1,441 تعداد دریافت فایل اصل مقاله: 1,925 |
||