Convergence properties of a class of nonlinear conjugate gradient methods
From MaRDI portal
Publication:336596
DOI10.1016/j.cor.2013.05.013zbMath1348.90628OpenAlexW2005717169MaRDI QIDQ336596
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.05.013
unconstrained optimizationconjugate gradient methoddescent propertyconvergence propertystrong Wolfe line search
Related Items
Global convergence of a modified conjugate gradient method, A subspace conjugate gradient algorithm for large-scale unconstrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- Benchmarking optimization software with performance profiles.