Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems

Section: Research Paper
Issue
Vol. 9 No. 1 (2012): Volume 9 Issue 1
Pages
73-84

Keywords:

Conjugate gradient methods, A special of conjugate gradient, Experimental Results

Abstract

This paper develops a special conjugate gradient algorithm for solving unconstrained minimized problems. This development can be regarded as some kind of convex combination of the MPR and MLS methods. Experimental results indicate that the new algorithm is more efficient than the Polak and Ribiere - algorithm.

References

Author

Basim A. Hassan

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

Identifiers

DOI: 10.33899/csmj.2012.163672

Download this PDF file
PDF

Statistics

How to Cite

Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems. (2012). AL-Rafidain Journal of Computer Sciences and Mathematics, 9(1), 73-84. https://doi.org/10.33899/csmj.2012.163672
Copyright and Licensing
Creative Commons License

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

How to Cite

Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems. (2012). AL-Rafidain Journal of Computer Sciences and Mathematics, 9(1), 73-84. https://doi.org/10.33899/csmj.2012.163672