An Optimum Line Search for Unconstrained Non-Polynomial Test Functions ‎U‎sing Nonlinear Conjugate Gradient Methods

International Journal of Mathematical Modelling & Computations

مقاله 3، دوره 10، 4 (Fall) - شماره پیاپی 40، اسفند 2020، صفحه 295-309   

نوع مقاله: Full Length Article

نویسندگان

Adam Ajimoti Ishaq¹؛ Tolulope Latunde^{* 2}؛ Folashade Mistura Jimoh¹

¹Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria

²Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti, Nigeria

چکیده

The nonlinear conjugate gradient method solves issues of the frame:
minimize f(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‎