An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ishaq A.A.; Latunde T.; Jimoh F.M.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION Year:2020 | Volume:10 | Issue:4 Page(s): 295-309

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods

Author(s)

Ishaq A.A. | Latunde T. | Jimoh F.M. | Issue Writer Certificate

Keywords

Nonlinear conjugate gradient method

Step-length

Line search

Unconstrained optimization problem

Large scale problems

Abstract

The Nonlinear conjugate gradient method solves issues of the frame: minimizef(x), x ∈,ℜ,employing an iterative plot, x(k+1) = x(k) + α, kd(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 great outcome when employed to a few unconstrained non-polynomial test functions.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Ishaq, A.A., Latunde, T., & Jimoh, F.M.. (2020). An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods. INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION, 10(4), 295-309. SID. https://sid.ir/paper/1002038/en

Vancouver: Copy

Ishaq A.A., Latunde T., Jimoh F.M.. An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods. INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION[Internet]. 2020;10(4):295-309. Available from: https://sid.ir/paper/1002038/en

IEEE: Copy

A.A. Ishaq, T. Latunde, and F.M. Jimoh, “An Optimum Line Search for Unconstrained Non-Polynomial Test Functions Using Nonlinear Conjugate Gradient Methods,” INTERNATIONAL JOURNAL OF MATHEMATICAL MODELLING & COMPUTATION, vol. 10, no. 4, pp. 295–309, 2020, [Online]. Available: https://sid.ir/paper/1002038/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops