Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi

Rozaimi, Nur Farah Hanis (2018) Three term Conjugate Gradient for solving unconstrained optimization / Nur Farah Hanis Rozaimi. Degree thesis, Universiti Teknologi MARA.


Conjugate Gradient (CG) method is one of the popular methods that solve the large- scale unconstrained optimization problems, because they do not need the storage of matrices. In this paper, we are particularly interested in three-term conjugate gradient methods. We are using only classical parameter on this paper. In this paper, we are using exact line search. These methods have been tested using only the selected optimization test function with different initial point from the nearest to the solution point to the furthest from the solution point. The result is analysed based on the number of the iteration and CPU time. Based on the result, Narushima et al. is the best method of all in term of both number of iteration and CPU times.


Item Type: Thesis (Degree)
CreatorsEmail / ID. Num
Rozaimi, Nur Farah HanisUNSPECIFIED
ContributionNameID Num. / Email
Thesis advisorJusoh, IbrahimUNSPECIFIED
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: 39360
Uncontrolled Keywords: Conjugate Gradient (CG) Methods ; Global Convergence ; Exact Line Searches


[img] Text

Download (122kB)


Fulltext is available at:
  • Kaunter Perkhidmatan Maklumat | Perpustakaan Cendekiawan | Dungun
  • ID Number



    View in Google Scholar

    Actions (login required)

    View Item View Item


    Downloads per month over past year