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

محورهای موضوعی : فصلنامه ریاضی

Adam Ishaq ¹ (Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria)
Tolulope Latunde ² (Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti, Nigeria)
Folashade Jimoh ³ (Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria)

تاریخ دریافت : 1399/04/17 تاریخ پذیرش : 1399/08/02 تاریخ انتشار : 1399/09/11

کلید واژه: Nonlinear conjugate gradient method, step-length, line search, unconstrained optimization problem, Large scale problems‎,

چکیده مقاله :

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.