Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
From MaRDI portal
Publication:5436916
DOI10.1080/10556780600795748zbMath1133.65035MaRDI QIDQ5436916
Li Zhang, Weijun Zhou, Dong-hui Li
Publication date: 18 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780600795748
global convergence; conjugate gradient method; inexact line search; Armijo line search; unconstrained optimization problem; DY method
Related Items
Unnamed Item, CGRS -- an advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method, Two modified Dai-Yuan nonlinear conjugate gradient methods, A modified nonlinear conjugate gradient method with the Armijo line search and its application, Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient hybrid conjugate gradient techniques
- Global convergence result for conjugate gradient methods
- Optimization. Algorithms and consistent approximations
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- Convergence Properties of Algorithms for Nonlinear Optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- 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
- Global convergence of conjugate gradient methods without line search
