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. Num...
保存先:
主要な著者: | Osman, W.F.H.W, Ibrahim, M.A.H., Mamat, M. |
---|---|
フォーマット: | Conference or Workshop Item |
言語: | English English |
出版事項: |
2018
|
主題: | |
オンライン・アクセス: | http://eprints.unisza.edu.my/1664/1/FH03-FIK-18-14473.jpg http://eprints.unisza.edu.my/1664/2/FH03-FIK-18-16990.pdf http://eprints.unisza.edu.my/1664/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Hybrid DFP-CG method for solving unconstrained optimization problems
著者:: Mustafa, Mamat, 等
出版事項: (2017) -
New hybrid BFGS-CG method for solving unconstrained optimization
著者:: Mustafa, M., 等
出版事項: (2021) -
A new search direction of DFP-CG method for solving unconstrained optimization problems
著者:: Wan Farah Hanan Wan Osman, 等
出版事項: (2018) -
The CG-BFGS method for unconstrained optimization problems
著者:: Mustafa, Mamat, 等
出版事項: (2013) -
The algorithms of Broyden-CG for unconstrained optimization problems
著者:: Mustafa, Mamat, 等
出版事項: (2014)