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

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

Adam Ishaq ¹ , Tolulope Latunde ² , Folashade Jimoh ³

1 - Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria
2 - Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti, Nigeria
3 - Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria

تاريخ الإرسال : 16 الثلاثاء , ذو القعدة, 1441 تاريخ التأكيد : 06 الجمعة , ربيع الأول, 1442 تاريخ الإصدار : 16 الثلاثاء , ربيع الثاني, 1442

الکلمات المفتاحية: 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.