A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems

DOI10.1007/s11071-012-0694-6zbMath1268.65066OpenAlexW2048794991MaRDI QIDQ354989

Xian-Zhen Jiang, Jin-Bao Jian

Publication date: 22 July 2013

Published in: Nonlinear Dynamics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11071-012-0694-6

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodsufficient descent property

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Numerical methods for variational inequalities and related problems (65K15)

Related Items (13)

A New Formula on the Conjugate Gradient Method for Removing Impulse Noise Images ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem ⋮ A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems ⋮ Maximum likelihood gradient-based iterative estimation algorithm for a class of input nonlinear controlled autoregressive ARMA systems ⋮ A modified hybrid conjugate gradient method for unconstrained optimization ⋮ A novel method of dynamic force identification and its application ⋮ Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization ⋮ A hybrid conjugate gradient method with descent property for unconstrained optimization ⋮ Real-time pricing method for smart grid based on social welfare maximization model ⋮ 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 ⋮ Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-objective global optimal parafoil homing trajectory optimization via Gauss pseudospectral method
• Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
• Two modified HS type conjugate gradient methods for unconstrained optimization problems
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• A new version of the Liu-Storey conjugate gradient method
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Testing Unconstrained Optimization Software
• 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
• Benchmarking optimization software with performance profiles.

This page was built for publication: A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems