An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
From MaRDI portal
Publication:1039699
DOI10.1016/J.AMC.2009.08.016zbMATH Open1181.65089OpenAlexW1966392521MaRDI QIDQ1039699FDOQ1039699
Authors: Li Zhang 
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
Recommendations
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search
- Global convergence of a nonlinear conjugate gradient method
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Nonlinear programming (90C30)
Cites Work
- CUTE
- Function minimization by conjugate gradients
- Line search algorithms with guaranteed sufficient decrease
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- 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
- Efficient generalized conjugate gradient algorithms. I: Theory
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- A modified PRP 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
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Title not available (Why is that?)
- The convergence properties of some new conjugate gradient methods
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- A three-parameter family of nonlinear conjugate gradient methods
- A survey of nonlinear conjugate gradient methods
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A note about WYL's conjugate gradient method and its applications
Cited In (43)
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell 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
- Some global convergence properties of the Wei-Yao-Liu conjugate gradient method with inexact line search
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- Application of a globally convergent hybrid conjugate gradient method in portfolio optimization
- 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
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property
- Another modified version of RMIL conjugate gradient method
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Hybrid random batch idea and nonlinear conjugate gradient method for accelerating charged polymer dynamics simulation
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- 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
- Some modified conjugate gradient methods for unconstrained optimization
- New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
- An improved Riemannian conjugate gradient method and its application to robust matrix completion
- Two modified Dai-Yuan nonlinear conjugate gradient methods
- Modified Yabe-Takano nonlinear conjugate gradient method
- A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection
- A modified PRP conjugate gradient method for unconstrained optimization and nonlinear equations
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems
- Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
- A class of one parameter conjugate gradient methods
- A family of conjugate gradient methods with guaranteed positiveness and descent for vector optimization
- Further studies on the Wei-Yao-Liu nonlinear conjugate gradient method
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- Two new conjugate gradient methods for unconstrained optimization
- A hybrid of DL and WYL nonlinear conjugate gradient methods
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- A hybrid CG algorithm for nonlinear unconstrained optimization with application in image restoration
- An efficient modified conjugate gradient algorithm under Wolfe conditions with applications in compressive sensing
- A survey of gradient methods for solving nonlinear optimization
- Wei-Yao-Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- A new class of nonlinear conjugate gradient coefficients for unconstrained optimization
- A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems
- A modification of classical conjugate gradient method using strong Wolfe line search
Uses Software
This page was built for publication: An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1039699)
