New Hybrid CG Algorithm Based on PR and FR Steps

Section: Research Paper
Issue
Vol. 2 No. 1 (2005): Volume 2 Issue 1
Pages
27-38

Keywords:

unconstrained Optimization, conjugate gradient algorithm, Polak-Ribière steps, Fletcher-Reeves steps

Abstract

In this paper, a new hybrid conjugate gradient algorithm is proposed for unconstrained optimization. This algorithm combines the desirable computation aspects of Polak-Ribire steps and useful theoretical features of Fletcher-Reeves CG-steps. Computational results for this algorithm are given and compared with those of the Fletcher and Polak standard CG methods showing a considerable improvement over the latter two methods.

References

Authors

Abbas Y. Al-Bayati

College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq

Khalil K. Abbo

College of Computers Sciences and Mathematics University of Mosul/Iraq

Asma M. Abdalah

Identifiers

DOI: 10.33899/csmj.2005.164065

Download this PDF file
PDF

Statistics

How to Cite

New Hybrid CG Algorithm Based on PR and FR Steps. (2005). AL-Rafidain Journal of Computer Sciences and Mathematics, 2(1), 27-38. https://doi.org/10.33899/csmj.2005.164065
Copyright and Licensing
Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

New Hybrid CG Algorithm Based on PR and FR Steps. (2005). AL-Rafidain Journal of Computer Sciences and Mathematics, 2(1), 27-38. https://doi.org/10.33899/csmj.2005.164065