Back to Search
Start Over
A New Search Direction of DFP-CG Method for Solving Unconstrained Optimization Problems.
- Source :
- AIP Conference Proceedings; 2018, Vol. 1974 Issue 1, p1-7, 7p
- Publication Year :
- 2018
-
Abstract
- 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. Numerical results show that the new algorithm is more efficient compared to the ordinary DFP method and proven to posses both sufficient descent and global convergence properties. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 0094243X
- Volume :
- 1974
- Issue :
- 1
- Database :
- Complementary Index
- Journal :
- AIP Conference Proceedings
- Publication Type :
- Conference
- Accession number :
- 130426272
- Full Text :
- https://doi.org/10.1063/1.5041555