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

PDF
  • Adam Ishaq1,
  • Tolulope Latunde*2,
  • Folashade Jimoh1,
  1. Department of Physical Sciences, Alhikmah University, Ilorin, Nigeria
  2. Department of Mathematics, Federal University Oye-Ekiti, Oye-Ekiti, Nigeria

Revised: 07-07-2020

Accepted: 23-10-2020

Published in Issue 01-12-2020

How to Cite

Ishaq, A., Latunde, T., & Jimoh, F. (2020). An Optimum Line Search for Unconstrained Non-Polynomial Test Functions ‎U‎sing Nonlinear Conjugate Gradient Methods. International Journal of Mathematical Modelling & Computations, 10(4), 295-309. https://oiccpress.com/ijm2c/article/view/11075

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.
PDF