Comment on ``A new three-term conjugate gradient method for unconstrained problem
From MaRDI portal
Publication:285045
DOI10.1007/s11075-015-0039-xzbMath1346.90765OpenAlexW1164749469MaRDI QIDQ285045
Publication date: 18 May 2016
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-015-0039-x
global convergenceconjugacy conditionthree-term conjugate gradient methodsufficient descent condition
Related Items (3)
A modified four-term extension of the Dai-Liao conjugate gradient method ⋮ Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method
Cites Work
- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- A new three-term conjugate gradient algorithm for unconstrained optimization
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: Comment on ``A new three-term conjugate gradient method for unconstrained problem
