| _version_ |
1860799414238445568
|
| building |
INTELEK Repository
|
| collection |
Online Access
|
| collectionurl |
https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072
|
| date |
2016-10-26 10:05:50
|
| eventvenue |
Sydney, Australia
|
| format |
Restricted Document
|
| id |
5911
|
| institution |
UniSZA
|
| originalfilename |
0621-01-FH03-FIK-18-12081.pdf
|
| person |
ITR
|
| recordtype |
oai_dc
|
| resourceurl |
https://intelek.unisza.edu.my/intelek/pages/view.php?ref=5911
|
| spelling |
5911 https://intelek.unisza.edu.my/intelek/pages/view.php?ref=5911 https://intelek.unisza.edu.my/intelek/pages/search.php?search=!collection407072 Restricted Document Conference Conference Paper application/pdf 4 1.6 Adobe Acrobat Pro DC 20 Paper Capture Plug-in ITR 2016-10-26 10:05:50 0621-01-FH03-FIK-18-12081.pdf UniSZA Private Access A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization 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. 41st International Conference of Science, Technology, Engineering and Management (ICSTEM) Sydney, Australia
|
| spellingShingle |
A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization
|
| summary |
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.
|
| title |
A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization
|
| title_full |
A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization
|
| title_fullStr |
A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization
|
| title_full_unstemmed |
A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization
|
| title_short |
A Modified Fletcher-Reeves Conjugate Gradient Method for Unconstrained Optimization
|
| title_sort |
modified fletcher-reeves conjugate gradient method for unconstrained optimization
|