Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems | ||
| AL-Rafidain Journal of Computer Sciences and Mathematics | ||
| Article 6, Volume 9, Issue 1, June 2012, Pages 73-84 PDF (384.67 K) | ||
| Document Type: Research Paper | ||
| DOI: 10.33899/csmj.2012.163672 | ||
| Author | ||
| Basim A. Hassan | ||
| College of Computer Sciences and Mathematics University of Mosul, Mosul, Iraq | ||
| 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. | ||
| Keywords | ||
| Conjugate gradient methods; A special of conjugate gradient; Experimental Results | ||
|
Statistics Article View: 186 PDF Download: 220 |
||