Mosul University
  • Register
  • Login
  • العربیة

AL-Rafidain Journal of Computer Sciences and Mathematics

Notice

As part of Open Journals’ initiatives, we create website for scholarly open access journals. If you are responsible for this journal and would like to know more about how to use the editorial system, please visit our website at https://ejournalplus.com or
send us an email to info@ejournalplus.com

We will contact you soon

  1. Home
  2. Volume 6, Issue 3
  3. Authors

Current Issue

By Issue

By Subject

Keyword Index

Author Index

Indexing Databases XML

About Journal

Aims and Scope

Editorial Board

Editorial Staff

Publication Ethics

Indexing and Abstracting

Related Links

Peer Review Process

News

New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization

    Abbas Y. Al-Bayati Huda I. Ahmed

AL-Rafidain Journal of Computer Sciences and Mathematics, 2009, Volume 6, Issue 3, Pages 21-35
10.33899/csmj.2009.163818

  • Show Article
  • Download
  • Cite
  • Statistics
  • Share

Abstract

Conjugate gradient methods are wildly used for unconstrained optimization especially when the dimension is large. In this paper we propose a new kind of nonlinear conjugate gradient methods which on the study of Dai and Liao (2001), the new idea is how to use the pair conjugate gradient method with this study (new cojugacy condition) which consider an inexact line search scheme but reduce to the old one if the line search is exact. Convergence analysis for this new method is provided. Our numerical results show that this new methods is very efficient for the given ten test function compared with other methods.
 
Keywords:
    unconstrained Optimization Conjugate gradient methods
  • PDF (430 K)
  • XML
(2009). New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization. AL-Rafidain Journal of Computer Sciences and Mathematics, 6(3), 21-35. doi: 10.33899/csmj.2009.163818
Abbas Y. Al-Bayati; Huda I. Ahmed. "New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization". AL-Rafidain Journal of Computer Sciences and Mathematics, 6, 3, 2009, 21-35. doi: 10.33899/csmj.2009.163818
(2009). 'New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization', AL-Rafidain Journal of Computer Sciences and Mathematics, 6(3), pp. 21-35. doi: 10.33899/csmj.2009.163818
New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization. AL-Rafidain Journal of Computer Sciences and Mathematics, 2009; 6(3): 21-35. doi: 10.33899/csmj.2009.163818
  • RIS
  • EndNote
  • BibTeX
  • APA
  • MLA
  • Harvard
  • Vancouver
  • Article View: 34
  • PDF Download: 39
  • LinkedIn
  • Twitter
  • Facebook
  • Google
  • Telegram
  • Home
  • Glossary
  • News
  • Aims and Scope
  • Privacy Policy
  • Sitemap
This journal is licensed under a Creative Commons Attribution 4.0 International (CC-BY 4.0)

Powered by eJournalPlus