New conjugacy coefficient for conjugate gradient method for unconstrained optimization
In this paper, we derived a new conjugacy coefficient of conjugate gradient method which is based on non-linear function using inexact line searches. This method satisfied sufficient descent condition and the converges globally is provided. The numerical results indicate that the new approach yields...
Gespeichert in:
Veröffentlicht in: | AL-Rafidain journal of computer sciences and mathematics 2013-07, Vol.10 (2), p.33-46 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | ara ; eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we derived a new conjugacy coefficient of conjugate gradient method which is based on non-linear function using inexact line searches. This method satisfied sufficient descent condition and the converges globally is provided. The numerical results indicate that the new approach yields very effective depending on number of iterations and number of functions evaluation .
In this paper, we derived a new contumacy coefficient of conjugate gradient method which is based on non-linear function using inexact line searches. This method satisfied sufficient descent condition and the converges globally is provided. The numerical results indicate that the new approach yields very effective depending on number of iterations and number of functions evaluation. |
---|---|
ISSN: | 1815-4816 2311-7990 2311-7990 |
DOI: | 10.33899/csmj.2013.163473 |