As part of Open Journals’ initiatives, we create website for scholarly open access journals.
If you are responsible for this journal and would like to know more about how to use the editorial system, please visit our website at
https://ejournalplus.com or send us an email to info@ejournalplus.com
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.
(2012). Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems. AL-Rafidain Journal of Computer Sciences and Mathematics, 9(1), 73-84. doi: 10.33899/csmj.2012.163672
Basim A. Hassan. "Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems". AL-Rafidain Journal of Computer Sciences and Mathematics, 9, 1, 2012, 73-84. doi: 10.33899/csmj.2012.163672
(2012). 'Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems', AL-Rafidain Journal of Computer Sciences and Mathematics, 9(1), pp. 73-84. doi: 10.33899/csmj.2012.163672
Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems. AL-Rafidain Journal of Computer Sciences and Mathematics, 2012; 9(1): 73-84. doi: 10.33899/csmj.2012.163672
