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

Document Type : Full Length Article


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

2 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.