کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4645450 | 1342034 | 2011 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A hybrid trust region algorithm for unconstrained optimization
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات محاسباتی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A hybrid trust region algorithm for unconstrained optimization A hybrid trust region algorithm for unconstrained optimization](/preview/png/4645450.png)
چکیده انگلیسی
This paper presents a hybrid trust region algorithm for unconstrained optimization problems. It can be regarded as a combination of ODE-based methods, line search and trust region techniques. A feature of the proposed method is that at each iteration, a system of linear equations is solved only once to obtain a trial step. Further, when the trial step is not accepted, the method performs an inexact line search along it instead of resolving a new linear system. Under reasonable assumptions, the algorithm is proven to be globally and superlinearly convergent. Numerical results are also reported that show the efficiency of this proposed method.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Numerical Mathematics - Volume 61, Issue 7, July 2011, Pages 900-909
Journal: Applied Numerical Mathematics - Volume 61, Issue 7, July 2011, Pages 900-909