New Scaled Proposed formulas For Conjugate Gradient Methods in Unconstrained Optimization
In this paper, three efficient Scaled Nonlinear Conjugate Gradient (CG) methods for solving unconstrained optimization problems are proposed. These algorithms are implemented with inexact line searches (ILS). Powell restarting criterion is applied to all these algorithms and gives dramatic saving in...
Saved in:
| Main Authors: | Abbas Al-Bayati, Marwan Jameel |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mosul University
2014-12-01
|
| Series: | Al-Rafidain Journal of Computer Sciences and Mathematics |
| Subjects: | |
| Online Access: | https://csmj.mosuljournals.com/article_163748_bf27dd86e3a9a419505f4127bb14b11c.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
New conjugacy condition with pair-conjugate gradient methods for unconstrained optimization
by: Abbas Al-Bayati, et al.
Published: (2009-09-01) -
A New Formula for Conjugate Gradient in Unconstrained Optimization
by: Hussein Wali, et al.
Published: (2020-05-01) -
A New effected Three-Term Hestenes-Stiefel Conjugate-Gradient Method for Solving Unconstrained Optimization Problems
by: Abbas Y. Al-Bayati, et al.
Published: (2023-02-01) -
A New Scaled Three-Term Conjugate Gradient Algorithms For Unconstrained Optimization
by: Zeyad M. Abdullah, et al.
Published: (2023-08-01) -
A New Parameterized Conjugate Gradient Method based on Generalized Perry Conjugate Gradient Method
by: Khalil K. Abbo, et al.
Published: (2023-02-01)