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: | Dr. Basim A. Hassan, Omer M. Esmaeel |
---|---|
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 |
Similar Items
-
Conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
by: Ling, Mei Mei
Published: (2015) -
A Modified Sufficient Descent Polak–Ribiére–Polyak Type Conjugate Gradient Method for Unconstrained Optimization Problems
by: Xiuyun Zheng, et al.
Published: (2018-09-01) -
A class of derivative free three-term descent Hestenes-Stiefel conjugate gradient algorithms for constrained nonlinear problems
by: Supaporn Chankong, et al.
Published: (2024-03-01) -
A Globally Convergence Spectral Conjugate Gradient Method for Solving Unconstrained Optimization Problems
by: Basim Hassan
Published: (2013-12-01) -
New Proposed Conjugate Gradient Method for Nonlinear Unconstrained Optimization
by: Salah G. Shareef, et al.
Published: (2016-12-01)