Development a special conjugate gradient algorithm for solving unconstrained minimization problems
Author
Source
al- Rafidain Journal of Computer Sciences and Mathematics
Issue
Vol. 9, Issue 1 (30 Apr. 2012), pp.73-84, 12 p.
Publisher
University of Mosul College of Computer Science and Mathematics
Publication Date
2012-04-30
Country of Publication
Iraq
No. of Pages
12
Main Subjects
Topics
Abstract AR
في هذا البحث تم استحداث خوارزمية من خوارزميات التدرج المترافق الطيفي لحل المسائل التصغيرية غير المقيدة.
هذا الاستحداث يمكن أن يعتبر نوعا من المجاميع المحدبة بطريقتي MPR و MLS. النتائج العددية أثبتت كفاءة الخوارزمية الجديدة مقارنة بخوارزمية Polak و Ribiere.
Abstract EN
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 .
American Psychological Association (APA)
Hasan, Basim A.. 2012. Development a special conjugate gradient algorithm for solving unconstrained minimization problems. al- Rafidain Journal of Computer Sciences and Mathematics،Vol. 9, no. 1, pp.73-84.
https://search.emarefa.net/detail/BIM-321953
Modern Language Association (MLA)
Hasan, Basim A.. Development a special conjugate gradient algorithm for solving unconstrained minimization problems. al- Rafidain Journal of Computer Sciences and Mathematics Vol. 9, no. 1 (2012), pp.73-84.
https://search.emarefa.net/detail/BIM-321953
American Medical Association (AMA)
Hasan, Basim A.. Development a special conjugate gradient algorithm for solving unconstrained minimization problems. al- Rafidain Journal of Computer Sciences and Mathematics. 2012. Vol. 9, no. 1, pp.73-84.
https://search.emarefa.net/detail/BIM-321953
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references : p. 84
Record ID
BIM-321953
