A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization

Mustafa, Mamat and Zahrahtul Amani, Zakaria and Fatma Susilawati, Mohamad (2016) A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization. In: 41st International Conference of Science, Technology, Engineering and Management (ICSTEM), 03-04 November 2016, Sydney.

[img] Text
Restricted to Registered users only

Download (183kB)


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: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics
Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Informatics & Computing
Depositing User: Muhammad Akmal Azhar
Date Deposited: 26 Oct 2020 01:34
Last Modified: 26 Oct 2020 01:34
URI: http://eprints.unisza.edu.my/id/eprint/621

Actions (login required)

View Item View Item