An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
From MaRDI portal
Publication:1039699
DOI10.1016/j.amc.2009.08.016zbMath1181.65089OpenAlexW1966392521MaRDI QIDQ1039699
Publication date: 23 November 2009
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2009.08.016
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Complexity and performance of numerical algorithms (65Y20)
Related Items (31)
An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property ⋮ Some modified conjugate gradient methods for unconstrained optimization ⋮ A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery ⋮ A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems ⋮ A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization ⋮ A class of one parameter 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 ⋮ Two new conjugate gradient methods for unconstrained optimization ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ Unnamed Item ⋮ A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems ⋮ Hybrid random batch idea and nonlinear conjugate gradient method for accelerating charged polymer dynamics simulation ⋮ Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property ⋮ A three-term conjugate gradient algorithm with quadratic convergence for unconstrained optimization problems ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ A hybrid of DL and WYL nonlinear conjugate gradient methods ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search ⋮ An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems ⋮ The convergence properties of RMIL+ conjugate gradient method under the strong Wolfe line search ⋮ Spectral modified Polak-Ribiére-Polyak projection conjugate gradient method for solving monotone systems of nonlinear equations ⋮ Wei–Yao–Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints ⋮ Two modified DY conjugate gradient methods for unconstrained optimization problems ⋮ A modification of classical conjugate gradient method using strong Wolfe line search ⋮ Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization ⋮ Two improved nonlinear conjugate gradient methods with the strong Wolfe line search ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations ⋮ Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems ⋮ Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization ⋮ A new class of nonlinear conjugate gradient coefficients for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The convergence properties of some new conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- A note about WYL's conjugate gradient method and its applications
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A modified PRP 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
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A three-parameter family of nonlinear 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
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- Line search algorithms with guaranteed sufficient decrease
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Some descent three-term conjugate gradient methods and their global convergence
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
This page was built for publication: An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
