Investigation on Extended Conjugate Gradient Non-Linear Methods for Solving Unconstrained Optimization

Abstract In this paper we have generalized the extended Dai-Yuan conjugate Gradient method by Considering the parameter in the denominator of as a convex combination. Three values of are computed in three different ways namely by assuming descent property, Pure Conjugacy and using Newton direction....

Full description

Saved in:
Bibliographic Details
Published inal-Tarbiyah wa-al-ʻilm lil-ʻulūm al-insānīyah : majallah ʻilmīyah muḥakkamah taṣduru ʻan Kullīyat al-Tarbiyah lil-ʻUlūm al-Insānīyah fī Jāmiʻat al-Mawṣil Vol. 26; no. 1; pp. 74 - 84
Main Authors Abbo, Khalil K, Waiss, Osama M. T
Format Journal Article
LanguageEnglish
Arabic
Published جامعة الموصل - كلية التربية 01.03.2013
College of Education for Pure Sciences
Subjects
gradient non-linear methods
numerical experiments
unconstrained optimization
الانحدار الخطي
الخوارزميات
الرياضيات
طرق التدرج المترافق
Online AccessGet full text

Cover

More Information
Summary:Abstract In this paper we have generalized the extended Dai-Yuan conjugate Gradient method by Considering the parameter in the denominator of as a convex combination. Three values of are computed in three different ways namely by assuming descent property, Pure Conjugacy and using Newton direction. The descent property and global convergence for the proposed algorithms are established. Our numerical experiments on some standard test functions show that there are considerable improvement on other classical methods in this field.
ISSN:1812-125X
2664-2530
DOI:10.33899/edusj.2013.89657