Hamzah, Muhammad Adib Usairi (2017) Comparison of four Conjugate Gradient method with exact line search / Muhammad Adib Usairi Hamzah. Degree thesis, Universiti Teknologi MARA.
Abstract
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.
Metadata
| Item Type: | Thesis (Degree) | ||||||
|---|---|---|---|---|---|---|---|
| Creators: |
|
||||||
| Contributors: |
|
||||||
| Subjects: | Q Science > QA Mathematics > Mathematical statistics. Probabilities Q Science > QA Mathematics > Analysis Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Algorithms |
||||||
| Divisions: | Universiti Teknologi MARA, Terengganu > Kuala Terengganu Campus > Faculty of Computer and Mathematical Sciences | ||||||
| Programme: | Bachelor of Science (Hons) Computational Mathematics | ||||||
| Item ID: | 41213 | ||||||
| Uncontrolled Keywords: | Conjugate Gradient(CG) ; Unconstrained Optimization ; Exact Line Search | ||||||
| URI: | http://ir.uitm.edu.my/id/eprint/41213 |
Download
![[img]](http://ir.uitm.edu.my/style/images/fileicons/text.png) |
Text
41213.pdf Download (122kB) |
Fulltext
Fulltext is available at:
ID Number
41213
Others
View in Google Scholar
Actions (login required)
 |
View Item |
Download Statistics
Download Statistics