An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods
عنوان مقاله: An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods
شناسه ملی مقاله: JR_IJMAC-10-4_003
منتشر شده در در سال 1399
شناسه ملی مقاله: JR_IJMAC-10-4_003
منتشر شده در در سال 1399
مشخصات نویسندگان مقاله:
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
خلاصه مقاله:
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
The nonlinear conjugate gradient method solves issues of the frame: minimize f(x), x∈Remploying an iterative plot, x(k+۱)=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.
کلمات کلیدی: Nonlinear conjugate gradient method, step-length, line search, unconstrained optimization problem, Large scale problems
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1589946/