Two modified DY conjugate gradient methods for unconstrained optimization problems

DOI10.1016/j.amc.2019.125004zbMath1433.90190OpenAlexW2999300733WikidataQ126378963 ScholiaQ126378963MaRDI QIDQ2293925

Dongdong Zhang, Shuo Wang, Zhi Bin Zhu

Publication date: 5 February 2020

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2019.125004

zbMATH Keywords

global convergenceconjugate gradient methodsufficient descent propertyunconstrained optimization problemstandard Wolfe line search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of reduced gradient type (90C52)

Related Items (7)

Unnamed Item ⋮ Two diagonal conjugate gradient like methods for unconstrained optimization ⋮ An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction ⋮ Two improved nonlinear conjugate gradient methods with the strong Wolfe line search ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations ⋮ Two spectral conjugate gradient methods for unconstrained optimization problems ⋮ An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems

Cites Work

• Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• 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
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
• An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
• Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
• A regularized alternating direction method of multipliers for a class of nonconvex problems
• A spectral conjugate gradient method for solving large-scale unconstrained optimization
• 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
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• A new efficient conjugate gradient method for unconstrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two modified DY conjugate gradient methods for unconstrained optimization problems