Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search
From MaRDI portal
Publication:531627
DOI10.1016/j.amc.2011.01.097zbMath1217.65108MaRDI QIDQ531627
Zeng-xin Wei, Sha Lu, Liliu Mo
Publication date: 19 April 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.097
65K05: Numerical mathematical programming methods
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- The convergence properties of some new conjugate gradient methods
- A note about WYL's conjugate gradient method and its applications
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Conjugate gradient methods with Armijo-type line searches.
- A new version of the Liu-Storey conjugate gradient method
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- New line search methods for unconstrained optimization
- A new family of conjugate gradient methods
- Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
- 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 the Fletcher-Reeves method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- New properties of a nonlinear conjugate gradient method
