Global convergence of new modified CG method with inexact line search

Volume 16 , Issue 2 , April 2014 , Pages 17-26

Authors

Latif S. Ivan 1 ; Mohammed J. Lajan 2

1 Dept. of Mathematics, College of Education, University of Salahaddin

2 Dept. of Mathematics, Faculty of Science and Education, School of Science, University of Sulaimani

DOI logo 10.17656/jzs.10290

Keywords

Abstract


The conjugate gradient (CG) method has played a special role in solving non-linear

unconstrained optimization problems due to the simplicity of their-iterations and their very low

memory requirements. In this paper we take a modified to the Dai-Yuan (DY) conjugate

gradient methods such that the direction generated by the modified method provides a descent

direction for the optimization function and establish some global convergence of the proposed

method. Numerical results effective and promising by comparing with CG method.

Statistics
  • Article view423
  • Downloads0
  • Published at24 April 2014

  • RIS
  • BibTeX
  • EndNote
  • Mendeley
  • APA (7th edition)
  • MLA (9th edition)
  • Chicago
  • Harvard
  • IEEE
  • Vancouver