تعداد نشریات | 340 |
تعداد شمارهها | 6,870 |
تعداد مقالات | 56,673 |
تعداد مشاهده مقاله | 47,736,312 |
تعداد دریافت فایل اصل مقاله | 36,998,849 |
An Optimum Line Search for Unconstrained Non-Polynomial Test Functions using Nonlinear Conjugate Gradient Methods | ||
International Journal of Mathematical Modelling & Computations | ||
دوره 10، 4 (Fall) - شماره پیاپی 40، زمستان 2020 | ||
نوع مقاله: Full Length Article | ||
نویسندگان | ||
Adam Ajimoti Ishaq1؛ Tolulope Latunde ![]() ![]() | ||
1Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria | ||
2Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti,Nigeria | ||
چکیده | ||
The nonlinear conjugate gradient method solves issues of the frame: minimizef(▁x),▁x∈R employing an iterative plot, ▁x^((k+1))=▁x^((k))+α_k ▁d^((k)), where f is a non-polynomial function. We utilized two variants of the optimum line search namely, direct and indirect methods, to compute the step-length in this paper. Both line searches yielded a great outcome when employed to a few unconstrained non-polynomial test functions. | ||
کلیدواژهها | ||
Nonlinear conjugate gradient method؛ step-length؛ line search؛ unconstrained optimization problem؛ large scale problems | ||
آمار تعداد مشاهده مقاله: 28 |