An Efficient Modified AZPRP Conjugate Gradient Method for Large-Scale Unconstrained Optimization Problem
To find a solution of unconstrained optimization problems, we normally use a conjugate gradient (CG) method since it does not cost memory or storage of second derivative like Newton’s method or Broyden–Fletcher–Goldfarb–Shanno (BFGS) method. Recently, a new modification of Polak and Ribiere method w...
Saved in:
Main Authors: | Ahmad Alhawarat, Thoi Trung Nguyen, Ramadan Sabra, Zabidin Salleh |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2021-01-01
|
Series: | Journal of Mathematics |
Online Access: | http://dx.doi.org/10.1155/2021/6692024 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Modification of Nonlinear Conjugate Gradient Method with Weak Wolfe-Powell Line Search
by: Ahmad Alhawarat, et al.
Published: (2017-01-01) -
Solving Large-Scale Unconstrained Optimization Problems with an Efficient Conjugate Gradient Class
by: Sanaz Bojari, et al.
Published: (2024-01-01) -
A New Modified Three-Term Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence
by: Bakhtawar Baluch, et al.
Published: (2017-01-01) -
A Modified Hybrid Conjugate Gradient Method for Unconstrained Optimization
by: Minglei Fang, et al.
Published: (2021-01-01) -
A Conjugate Gradient Method with Global Convergence for Large-Scale Unconstrained Optimization Problems
by: Shengwei Yao, et al.
Published: (2013-01-01)