Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods
From MaRDI portal
Publication:856066
DOI10.1016/j.amc.2006.01.078zbMath1111.65056OpenAlexW2003029626MaRDI QIDQ856066
Publication date: 7 December 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.01.078
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limited memory BFGS method for large scale optimization
- Efficient hybrid conjugate gradient techniques
- Global convergence result for conjugate gradient methods
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Further insight into the convergence of the Fletcher-Reeves method
- Conditions for Superlinear Convergence in l1 and l Solutions of Overdetermined Non-linear Equations
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Restart procedures for the conjugate gradient method
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- The conjugate gradient method in extremal problems
- Global convergence property of \(s\)-dependent GFR conjugate gradient method
This page was built for publication: Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods
