A New sufficient descent Conjugate Gradient Method for Nonlinear Optimization
In this paper, a new conjugate gradient method based on exact step size which produces sufficient descent search direction at every iteration is introduced. We prove its global convergence, and give some results to illustrate its efficiency by comparing with the Polak and Ribiere method.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Arabic |
| Published: |
College of Computer Science and Mathematics, University of Mosul
2014-12-01
|
| Series: | المجلة العراقية للعلوم الاحصائية |
| Subjects: | |
| Online Access: | https://stats.mosuljournals.com/article_89208_9774a422c9ce78f054ef3f0a02b6d907.pdf |
| Summary: | In this paper, a new conjugate gradient method based on exact step size which produces sufficient descent search direction at every iteration is introduced. We prove its global convergence, and give some results to illustrate its efficiency by comparing with the Polak and Ribiere method. |
|---|---|
| ISSN: | 1680-855X 2664-2956 |