A hybrid of DL and WYL nonlinear conjugate gradient methods
From MaRDI portal
Publication:1723746
DOI10.1155/2014/279891zbMath1449.90366OpenAlexW1985873469WikidataQ59037562 ScholiaQ59037562MaRDI QIDQ1723746
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/279891
Related Items (5)
Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems ⋮ A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems ⋮ Two modified three-term type conjugate gradient methods and their global convergence for unconstrained optimization ⋮ A novel value for the parameter in the Dai-Liao-type conjugate gradient method ⋮ Two modified spectral conjugate gradient methods and their global convergence for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- The convergence properties of some new conjugate gradient methods
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- A note about WYL's conjugate gradient method and its applications
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method
- 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
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Restart procedures for the conjugate gradient method
- CUTE
- Line search algorithms with guaranteed sufficient decrease
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
This page was built for publication: A hybrid of DL and WYL nonlinear conjugate gradient methods
