A new conjugate gradient method for unconstrained optimization with sufficient descent
Conjugate gradient (CG) methods represent an important computational innovation in solving large-scaled unconstrained optimization problems. There are many different versions of CG methods. Although some methods are equivalent to each other, their performances are quite different. This paper present...
Published in: | AIP Conference Proceedings |
---|---|
Main Author: | |
Format: | Conference paper |
Language: | English |
Published: |
American Institute of Physics Inc.
2014
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904130994&doi=10.1063%2f1.4882534&partnerID=40&md5=e9682600e94a37ef6837c4d0d0fc454c |
id |
2-s2.0-84904130994 |
---|---|
spelling |
2-s2.0-84904130994 Yussoff N.H.M.; Mamat M.; Rivaie M.; Mohd I. A new conjugate gradient method for unconstrained optimization with sufficient descent 2014 AIP Conference Proceedings 1602 10.1063/1.4882534 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904130994&doi=10.1063%2f1.4882534&partnerID=40&md5=e9682600e94a37ef6837c4d0d0fc454c Conjugate gradient (CG) methods represent an important computational innovation in solving large-scaled unconstrained optimization problems. There are many different versions of CG methods. Although some methods are equivalent to each other, their performances are quite different. This paper presents a new CG method based on modification of the original CG methods. The important criteria of this new CG method are its global convergence properties. Numerical result shows that this new CG method performs better than the original CG methods. © 2014 AIP Publishing LLC. American Institute of Physics Inc. 0094243X English Conference paper |
author |
Yussoff N.H.M.; Mamat M.; Rivaie M.; Mohd I. |
spellingShingle |
Yussoff N.H.M.; Mamat M.; Rivaie M.; Mohd I. A new conjugate gradient method for unconstrained optimization with sufficient descent |
author_facet |
Yussoff N.H.M.; Mamat M.; Rivaie M.; Mohd I. |
author_sort |
Yussoff N.H.M.; Mamat M.; Rivaie M.; Mohd I. |
title |
A new conjugate gradient method for unconstrained optimization with sufficient descent |
title_short |
A new conjugate gradient method for unconstrained optimization with sufficient descent |
title_full |
A new conjugate gradient method for unconstrained optimization with sufficient descent |
title_fullStr |
A new conjugate gradient method for unconstrained optimization with sufficient descent |
title_full_unstemmed |
A new conjugate gradient method for unconstrained optimization with sufficient descent |
title_sort |
A new conjugate gradient method for unconstrained optimization with sufficient descent |
publishDate |
2014 |
container_title |
AIP Conference Proceedings |
container_volume |
1602 |
container_issue |
|
doi_str_mv |
10.1063/1.4882534 |
url |
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84904130994&doi=10.1063%2f1.4882534&partnerID=40&md5=e9682600e94a37ef6837c4d0d0fc454c |
description |
Conjugate gradient (CG) methods represent an important computational innovation in solving large-scaled unconstrained optimization problems. There are many different versions of CG methods. Although some methods are equivalent to each other, their performances are quite different. This paper presents a new CG method based on modification of the original CG methods. The important criteria of this new CG method are its global convergence properties. Numerical result shows that this new CG method performs better than the original CG methods. © 2014 AIP Publishing LLC. |
publisher |
American Institute of Physics Inc. |
issn |
0094243X |
language |
English |
format |
Conference paper |
accesstype |
|
record_format |
scopus |
collection |
Scopus |
_version_ |
1820775478255943680 |