An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods
Subject Areas : International Journal of Mathematical Modelling & Computations
Adam Ishaq
1
(Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria)
Tolulope Latunde
2
(Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti, Nigeria)
Folashade Jimoh
3
(Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria)
Keywords: Nonlinear conjugate gradient method, step-length, line search, unconstrained optimization problem, Large scale problems,
Abstract :
The nonlinear conjugate gradient method solves issues of the frame: minimize f(x), x∈Remploying 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.