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 |
| Summary: | 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. |
|---|---|
| ISSN: | 0094243X |
| DOI: | 10.1063/1.4882534 |