Conjugate gradient methods with Armijo-type line searches.
From MaRDI portal
Publication:1611089
DOI10.1007/s102550200010zbMath1114.90479OpenAlexW2089758800MaRDI QIDQ1611089
Publication date: 22 January 2003
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s102550200010
global convergenceconjugate gradient methodline searchHestenes-Stiefel methodUnconstrained optimization
Related Items (23)
Spectral method and its application to the conjugate gradient method ⋮ A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems ⋮ A PRP-based residual method for large-scale monotone nonlinear equations ⋮ Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method ⋮ Convergence properties of the dependent PRP conjugate gradient methods ⋮ Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization ⋮ A short note on the global convergence of the unmodified PRP method ⋮ Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search ⋮ A derivative-free conjugate residual method using secant condition for general large-scale nonlinear equations ⋮ Unnamed Item ⋮ A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization ⋮ A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods ⋮ A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression ⋮ Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ A new smoothing conjugate gradient method for solving nonlinear nonsmooth complementarity problems ⋮ An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ A practical PR+ conjugate gradient method only using gradient ⋮ Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search ⋮ On the convergence properties of the unmodified PRP method with a non-descent line search ⋮ The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems ⋮ Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search ⋮ The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems
Uses Software
Cites Work
- On the limited memory BFGS method for large scale optimization
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Further insight into the convergence of the Fletcher-Reeves method
- Minimization of functions having Lipschitz continuous first partial derivatives
- Convergence Properties of Algorithms for Nonlinear Optimization
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Global convergence property of \(s\)-dependent GFR conjugate gradient method
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Conjugate gradient methods with Armijo-type line searches.
