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...
| Main Authors: | , , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Wiley
2021-01-01
|
| 丛编: | Journal of Mathematics |
| 在线阅读: | http://dx.doi.org/10.1155/2021/6692024 |