A new search direction of DFP-CG method for solving unconstrained optimization problems
The conjugate gradient (CG) and Davidon, Fletcher and Powell (DFP) method are both well known solvers for solving unconstrained optimization problems. In this paper, we proposed a new hybrid DFP-CG method and compared with the ordinary DFP method in terms of number of iteration and CPU times. Numeri...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2018
|
| Online Access: | http://discol.umk.edu.my/id/eprint/8850/ https://aip.scitation.org/doi/10.1063/1.5041555 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|