An efficient spectral conjugate gradient parameter with descent condition for unconstrained optimization

Mustafa Mamat, Ibrahim Mohammed Sulaiman, Malik Maulana, Sukono, Zahrahtul Amani Zakaria

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The spectral gradient parameters and conjugate gradient algorithms are among the most efficient algorithms for solving large-scale unconstrained optimization problems. This is due to efficient numerical performance and simplicity of their algorithms. Numerous studies have been done recently to improve these methods. In this paper, we proposed an efficient spectral conjugate gradient algorithm by combining the spectral gradient parameter and conjugate gradient coefficient. The modified spectral conjugate gradient method satisfies the sufficient descent condition independent of line search procedure. An interesting feature of the proposed method is that it can be applied to large-scale unconstrained optimization problems. Preliminary numerical results are presented under strong Wolfe line search to illustrate the efficiency of the proposed method.

Original languageEnglish
Pages (from-to)2487-2493
Number of pages7
JournalJournal of Advanced Research in Dynamical and Control Systems
Volume12
Issue number2
DOIs
Publication statusPublished - 2020

Keywords

  • Conjugate gradient methods
  • Convergence analysis
  • Line search procedure
  • Spectral CG method
  • Unconstrained optimization

Fingerprint Dive into the research topics of 'An efficient spectral conjugate gradient parameter with descent condition for unconstrained optimization'. Together they form a unique fingerprint.

  • Cite this