Modified new conjugate gradient method for Unconstrained Optimization
The current paper modified method of conjugate gradient for solving problems of unconstrained optimization. The modified method convergence is achieved by assuming some hypotheses. The statistical results demonstrate that the modified method is efficient for solving problems of Unconstrained Nonlin...
Saved in:
Main Authors: | Zeyad M. Abdullah, Hameed M, Sadeq, Hisham M, Azzam, Mundher A. Khaleel |
---|---|
Format: | Article |
Language: | English |
Published: |
Tikrit University
2019-09-01
|
Series: | Tikrit Journal of Pure Science |
Subjects: | |
Online Access: | https://tjpsj.org/index.php/tjps/article/view/422 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A New Scaled Three-Term Conjugate Gradient Algorithms For Unconstrained Optimization
by: Zeyad M. Abdullah, et al.
Published: (2023-08-01) -
Anew Conjugate Gradient Algorithm Based on The (Dai-Liao) Conjugate Gradient Method
by: SHAHER QAHTAN HUSSEIN, et al.
Published: (2020-02-01) -
New Hybrid Conjugate Gradient Method as a Convex Combination of Dai–Liao and Wei–Yao–Liu
by: Zeyad Mohammed Abdullah, et al.
Published: (2021-12-01) -
A New Hybrid of DY and CGSD Conjugate Gradient Methods for Solving Unconstrained Optimization Problems
by: Zeyad Mohammed Abdullah, et al.
Published: (2021-09-01) -
A modified three-term conjugate gradient method for large –scale optimization
by: Zaydan B. Mohammed, et al.
Published: (2020-03-01)