An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods
Publish Year: 1399
Type: Journal paper
Language: English
View: 172
This Paper With 15 Page And PDF Format Ready To Download
- Certificate
- I'm the author of the paper
Export:
Document National Code:
JR_IJMAC-10-4_003
Index date: 17 January 2023
An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods 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.
An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods Keywords:
Nonlinear conjugate gradient method , step-length , line search , unconstrained optimization problem , Large scale problems
An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods authors
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