A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization

Mehiddin Al-Baali, Yasushi Narushima*, Hiroshi Yabe

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةمراجعة النظراء

38 اقتباسات (Scopus)

ملخص

Recently, conjugate gradient methods, which usually generate descent search directions, are useful for large-scale optimization. Narushima et al. (SIAM J Optim 21:212–230, 2011) have proposed a three-term conjugate gradient method which satisfies a sufficient descent condition. We extend this method to two parameters family of three-term conjugate gradient methods which can be used to control the magnitude of the directional derivative. We show that these methods converge globally and work well for suitable choices of the parameters. Numerical results are also presented.

اللغة الأصليةEnglish
الصفحات (من إلى)89-110
عدد الصفحات22
دوريةComputational Optimization and Applications
مستوى الصوت60
رقم الإصدار1
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يناير 2014

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2606???
  • ???subjectarea.asjc.2600.2605???
  • ???subjectarea.asjc.2600.2604???

بصمة

أدرس بدقة موضوعات البحث “A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا