Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
From MaRDI portal
Publication:1891684
DOI10.1007/BF02663897zbMath0834.90122MaRDI QIDQ1891684
Ji-ye Han, Guang-Hui Liu, Hong-Xia Yin
Publication date: 31 July 1995
Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)
Related Items (34)
Some modified conjugate gradient methods for unconstrained optimization ⋮ New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems ⋮ New hybrid conjugate gradient method as a convex combination of LS and FR methods ⋮ Global convergence properties of the two new dependent Fletcher-Reeves conjugate gradient methods ⋮ On the convergence of \(s\)-dependent GFR conjugate gradient method for unconstrained optimization ⋮ Convergence properties of the dependent PRP conjugate gradient methods ⋮ New conjugate gradient-like methods for unconstrained optimization ⋮ The convergence properties of some new conjugate gradient methods ⋮ An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search ⋮ Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search ⋮ A descent nonlinear conjugate gradient method for large-scale unconstrained optimization ⋮ A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization ⋮ On the convergence rate of Fletcher‐Reeves nonlinear conjugate gradient methods satisfying strong Wolfe conditions: Application to parameter identification in problems governed by general dynamics ⋮ Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property ⋮ Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search ⋮ The global convergence of a new mixed conjugate gradient method for unconstrained optimization ⋮ A hybrid of DL and WYL nonlinear conjugate gradient methods ⋮ A three-parameter family of nonlinear conjugate gradient methods ⋮ Global convergence of a modified spectral FR conjugate gradient method ⋮ A globally convergent gradient-like method based on the Armijo line search ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ A conjugate gradient method for unconstrained optimization problems ⋮ A modified CG-DESCENT method for unconstrained optimization ⋮ Two new conjugate gradient methods based on modified secant equations ⋮ A class of modified FR conjugate gradient method and applications to non-negative matrix factorization ⋮ A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems ⋮ Some descent three-term conjugate gradient methods and their global convergence ⋮ Global convergence property of \(s\)-dependent GFR conjugate gradient method ⋮ A modified PRP conjugate gradient method ⋮ Two hybrid nonlinear conjugate gradient methods based on a modified secant equation ⋮ A modified bat algorithm with conjugate gradient method for global optimization ⋮ Conjugate gradient methods with Armijo-type line searches.
Cites Work
- A new three-term conjugate gradient method
- Periodically preconditioned conjugate gradient-restoration algorithm
- Conjugate Gradient Methods less Dependent on Conjugacy
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Globally convergent conjugate gradient algorithms
- Rate of Convergence of Several Conjugate Gradient Algorithms
- Function minimization by conjugate gradients
This page was built for publication: Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
