Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah
One of the best solution to solve unconstrained optimization problems is by using Conjugate Gradient(CG) method it is due to low memory requirement. Hence, it can be used to solve large problem. By using coefficient of CG( /?k ) for this research, number of iteration and CPU time are calculated for...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 語言: | English |
| 出版: |
2017
|
| 主題: | |
| 在線閱讀: | https://ir.uitm.edu.my/id/eprint/41213/1/41213.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!