|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 86 - Issue 15 |
| Published: January 2014 |
| Authors: Thamera K. Alkhashab |
10.5120/15065-3509
|
Thamera K. Alkhashab . Modified Conjugate Gradient Method for Unconstrained Optimization. International Journal of Computer Applications. 86, 15 (January 2014), 42-46. DOI=10.5120/15065-3509
@article{ 10.5120/15065-3509,
author = { Thamera K. Alkhashab },
title = { Modified Conjugate Gradient Method for Unconstrained Optimization },
journal = { International Journal of Computer Applications },
year = { 2014 },
volume = { 86 },
number = { 15 },
pages = { 42-46 },
doi = { 10.5120/15065-3509 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2014
%A Thamera K. Alkhashab
%T Modified Conjugate Gradient Method for Unconstrained Optimization%T
%J International Journal of Computer Applications
%V 86
%N 15
%P 42-46
%R 10.5120/15065-3509
%I Foundation of Computer Science (FCS), NY, USA
Conjugate gradient method holds an important role in solving unconstrained Optimizations , especially for large scale problems. Numerous studies and modific ations have been done to improve this method . In this paper , we propose a new conjugate gradient meth od which is computed by modifying Dai and Yuan formula . This new formula for the denominator is introduced and the numerator of Dai and Yuan for mula is retrained , but still possesses global converge nce properties. Numerical results based on number of iterations and number of function evaluations by usin g exact line search have shown that the new formul a is an efficient when we comparative it with the oth er conjugate gradient methods.