Numerical Comparison of Line Search Criteria in Nonlinear Conjugate Gradient Algorithms

Simple item page
dc.creatorAdeleke, O. J., Aderemi, O. A., Omoregbe, N. A., Adekunle, R. A.
dc.date2013-03
dc.date.accessioned2025-03-27T12:33:04Z
dc.descriptionOne of the open problems known to researchers on the application of nonlinear conjugate gradient methods for addressing unconstrained optimization problems is the influence of accuracy of linear search procedure on the performance of the conjugate gradient algorithm. Key to any CG algorithm is the computation of an optimalstep size for which many procedures have been postulated. In this paper, we assess and compare the performance of a modified Armijo and Wolfe line search procedures on three variants of nonlinear CGM by carrying out a numerical test. Experiments reveal that our modified procedure and the strong Wolfe procedures guaranteed fast convergence.
dc.formatapplication/pdf
dc.identifierhttp://eprints.covenantuniversity.edu.ng/2927/
dc.identifier.urihttps://repository.covenantuniversity.edu.ng/handle/123456789/32124
dc.languageen
dc.publisherEuropean Centre for Research Training and Development UK
dc.subjectHA Statistics, QA Mathematics, QA75 Electronic computers. Computer science
dc.titleNumerical Comparison of Line Search Criteria in Nonlinear Conjugate Gradient Algorithms
dc.typeArticle

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Adeleke 5.pdf
Size:
404.85 KB
Format:
Adobe Portable Document Format
Download

Collections

EPrint