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 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| id |
my-uitm-ir.41213 |
|---|---|
| record_format |
uketd_dc |
| spelling |
my-uitm-ir.412132021-02-02T05:38:56Z Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah 2017 Hamzah, Muhammad Adib Usairi Mathematical statistics. Probabilities Analysis Algorithms 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. 2017 Thesis https://ir.uitm.edu.my/id/eprint/41213/ https://ir.uitm.edu.my/id/eprint/41213/1/41213.pdf text en public degree Universiti Teknologi MARA Faculty of Computer and Mathematical Sciences Jusoh, Ibrahim |
| institution |
Universiti Teknologi MARA |
| collection |
UiTM Institutional Repository |
| language |
English |
| advisor |
Jusoh, Ibrahim |
| topic |
Mathematical statistics Probabilities Analysis Algorithms |
| spellingShingle |
Mathematical statistics Probabilities Analysis Algorithms Hamzah, Muhammad Adib Usairi Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah |
| description |
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. |
| format |
Thesis |
| qualification_level |
Bachelor degree |
| author |
Hamzah, Muhammad Adib Usairi |
| author_facet |
Hamzah, Muhammad Adib Usairi |
| author_sort |
Hamzah, Muhammad Adib Usairi |
| title |
Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah |
| title_short |
Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah |
| title_full |
Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah |
| title_fullStr |
Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah |
| title_full_unstemmed |
Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah |
| title_sort |
comparison of four conjugate gradient method with exact line search / muhammad adib usairi hamzah |
| granting_institution |
Universiti Teknologi MARA |
| granting_department |
Faculty of Computer and Mathematical Sciences |
| publishDate |
2017 |
| url |
https://ir.uitm.edu.my/id/eprint/41213/1/41213.pdf |
| _version_ |
1783734619810562048 |