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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | 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 every function with different method to compare the result which one is the best. |
|---|