New multi-step three-term conjugate gradient algorithms with inexact line searches

Abbas Younis Al-Bayati, Muna M. M. Ali

Abstract


This work suggests several multi-step three-term conjugate gradient (CG)-algorithms that satisfies their sufficient descent property and conjugacy conditions. First, we have  considered a number of well-known three-term CG-method, and we have, therefore, suggested two new classes of this type of algorithms which was based on hestenes and stiefel (HS) and polak-ribière (PR) formulas with four different versions. Both descent and conjugacy conditions for all the proposed algorithms are satisfied, at each iteration by using the strong Wolfe line search condition and it's accelerated version. These new suggested algorithms are some sort of modifications to the original  HS and PR  methods. These CG-algorithms are considered as a sort of the  memoryless BFGS update.  All of our new suggested methods are proved to be a  global convergent and numerically, more efficient than the similar methods in same area based on our selected set of used numerical problems.


Keywords


Three-term Conjugate gradient; Scaled conjugate gradient; Multi-step conjugate gradient;, Sufficient descent property; Inexact line searches; Global convergence property

Full Text:

PDF


DOI: http://doi.org/10.11591/ijeecs.v19.i3.pp1564-1573

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Indonesian Journal of Electrical Engineering and Computer Science (IJEECS)
p-ISSN: 2502-4752, e-ISSN: 2502-4760
This journal is published by the Institute of Advanced Engineering and Science (IAES) in collaboration with Intelektual Pustaka Media Utama (IPMU).

shopify stats IJEECS visitor statistics