Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems

Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems

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...

Full description

Bibliographic Details
Main Author: Basim Hassan
Format: Article
Language:Arabic
Published: Mosul University 2012-07-01
Series:Al-Rafidain Journal of Computer Sciences and Mathematics
Subjects:
conjugate gradient methods
a special of conjugate gradient
experimental results
Online Access:https://csmj.mosuljournals.com/article_163672_158222625ac95b2c541d57c2646f5e65.pdf
id doaj-36836f3d67c049eebfde1d4304578a87
record_format Article
spelling doaj-36836f3d67c049eebfde1d4304578a872020-11-25T04:02:55ZaraMosul UniversityAl-Rafidain Journal of Computer Sciences and Mathematics 1815-48162311-79902012-07-0191738410.33899/csmj.2012.163672163672Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization ProblemsBasim Hassan0College of Computer Sciences and Mathematics University of Mosul, Mosul, IraqThis 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.https://csmj.mosuljournals.com/article_163672_158222625ac95b2c541d57c2646f5e65.pdfconjugate gradient methodsa special of conjugate gradientexperimental results
collection DOAJ
language Arabic
format Article
sources DOAJ
author Basim Hassan
spellingShingle Basim Hassan
Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems
Al-Rafidain Journal of Computer Sciences and Mathematics
conjugate gradient methods
a special of conjugate gradient
experimental results
author_facet Basim Hassan
author_sort Basim Hassan
title Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems
title_short Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems
title_full Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems
title_fullStr Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems
title_full_unstemmed Development a Special Conjugate Gradient Algorithm for Solving Unconstrained Minimization Problems
title_sort development a special conjugate gradient algorithm for solving unconstrained minimization problems
publisher Mosul University
series Al-Rafidain Journal of Computer Sciences and Mathematics
issn 1815-4816
2311-7990
publishDate 2012-07-01
description 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.
topic conjugate gradient methods
a special of conjugate gradient
experimental results
url https://csmj.mosuljournals.com/article_163672_158222625ac95b2c541d57c2646f5e65.pdf
work_keys_str_mv AT basimhassan developmentaspecialconjugategradientalgorithmforsolvingunconstrainedminimizationproblems
_version_ 1724441739432820736

Similar Items