A modified fletcher-reeves conjugate gradient method for unconstrained optimization

Abdelrahman, Abashar and Mustafa, Mamat and Ahmad, Alhawarat and Fatma Susilawati, Mohamad and Zabidin, Salleh and Zahrahtul Amani, Zakaria (2017) A modified fletcher-reeves conjugate gradient method for unconstrained optimization. International Journal of Advances in Science Engineering and Technology, 5 (1). pp. 1-4. ISSN 2321-9009

[img] Text
Restricted to Registered users only

Download (179kB)


Conjugate gradient (CG) method is one of many tools used to solve large optimization unconstrained problems. From 1952 until now many methods appeared to improve CPU time and number of iteration which is needed to reach the optimum solution. In this paper we depict a new positive CG method derived from Fletcher–Reeves (FR) method, the new coefficient achieves the global convergence properties under exact line search. In addition, it possesses the sufficient descent condition. The numerical computations where the step size achieves by exact line search show the efficiency of the new method is better than FR method; furthermore it solves all test functions.

Item Type: Article
Uncontrolled Keywords: Conjugate Gradient, Global Convergence, Exact Line Search, Optimum Solution.
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Informatics & Computing
Depositing User: Fatin Safura
Date Deposited: 22 Feb 2022 01:25
Last Modified: 22 Feb 2022 01:25
URI: http://eprints.unisza.edu.my/id/eprint/5603

Actions (login required)

View Item View Item