Cargando…
Dai-Kou type conjugate gradient methods with a line search only using gradient
In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope. Under suitable conditions, the developed methods are globally convergent. Numerical...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Springer International Publishing
2017
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380739/ https://www.ncbi.nlm.nih.gov/pubmed/28435203 http://dx.doi.org/10.1186/s13660-017-1341-z |
_version_ | 1782519805917528064 |
---|---|
author | Huang, Yuanyuan Liu, Changhe |
author_facet | Huang, Yuanyuan Liu, Changhe |
author_sort | Huang, Yuanyuan |
collection | PubMed |
description | In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope. Under suitable conditions, the developed methods are globally convergent. Numerical tests and comparisons with the PRP+ conjugate gradient method only using gradient show that the methods are efficient. |
format | Online Article Text |
id | pubmed-5380739 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2017 |
publisher | Springer International Publishing |
record_format | MEDLINE/PubMed |
spelling | pubmed-53807392017-04-20 Dai-Kou type conjugate gradient methods with a line search only using gradient Huang, Yuanyuan Liu, Changhe J Inequal Appl Research In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope. Under suitable conditions, the developed methods are globally convergent. Numerical tests and comparisons with the PRP+ conjugate gradient method only using gradient show that the methods are efficient. Springer International Publishing 2017-04-04 2017 /pmc/articles/PMC5380739/ /pubmed/28435203 http://dx.doi.org/10.1186/s13660-017-1341-z Text en © The Author(s) 2017 Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. |
spellingShingle | Research Huang, Yuanyuan Liu, Changhe Dai-Kou type conjugate gradient methods with a line search only using gradient |
title | Dai-Kou type conjugate gradient methods with a line search only using gradient |
title_full | Dai-Kou type conjugate gradient methods with a line search only using gradient |
title_fullStr | Dai-Kou type conjugate gradient methods with a line search only using gradient |
title_full_unstemmed | Dai-Kou type conjugate gradient methods with a line search only using gradient |
title_short | Dai-Kou type conjugate gradient methods with a line search only using gradient |
title_sort | dai-kou type conjugate gradient methods with a line search only using gradient |
topic | Research |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5380739/ https://www.ncbi.nlm.nih.gov/pubmed/28435203 http://dx.doi.org/10.1186/s13660-017-1341-z |
work_keys_str_mv | AT huangyuanyuan daikoutypeconjugategradientmethodswithalinesearchonlyusinggradient AT liuchanghe daikoutypeconjugategradientmethodswithalinesearchonlyusinggradient |