Title of article
An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods
Author/Authors
Ishaq, A. A. Department of Physical Sciences - Alhikmah University - Ilorin, Nigeria , Latunde, T. Department of Mathematics - Federal University Oye-Ekiti - Oye-Ekiti, Nigeria , Jimoh, F. M. Department of Physical Sciences - Alhikmah University - Ilorin, Nigeria
Pages
15
From page
295
To page
309
Abstract
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.
Keywords
Nonlinear conjugate gradient method , Step-length , Line search , Unconstrained optimization problem , Large scale problems
Journal title
International Journal of Mathematical Modelling and Computations
Serial Year
2020
Record number
2731313
Link To Document