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.

Abstract

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.

Metadata

Item Type: Thesis (Degree)
Creators:
Creators
Email / ID Num.
Rozaimi, Nur Farah Hanis
UNSPECIFIED
Contributors:
Contribution
Name
Email / ID Num.
Thesis advisor
Jusoh, Ibrahim
UNSPECIFIED
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
Keywords: Conjugate Gradient (CG) Methods ; Global Convergence ; Exact Line Searches
Date: January 2018
URI: https://ir.uitm.edu.my/id/eprint/39360
Edit Item
Edit Item

Download

[thumbnail of 39360.pdf] Text
39360.pdf

Download (122kB)

Digital Copy

Digital (fulltext) is available at:

Physical Copy

Physical status and holdings:
Item Status:

ID Number

39360

Indexing