Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization

DOI10.1007/s11071-014-1303-7zbMath1314.90065OpenAlexW1996878808MaRDI QIDQ2345746

Xian-Zhen Jiang, Jin-Bao Jian

Publication date: 20 May 2015

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

Full work available at URL: https://doi.org/10.1007/s11071-014-1303-7

zbMATH Keywords

unconstrained optimizationglobal convergencenumerical experimentsconjugate gradient methoddisturbance factor

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (9)

A new conjugate gradient algorithm with sufficient descent property for unconstrained optimization ⋮ Two new conjugate gradient methods for unconstrained optimization ⋮ A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ Unnamed Item ⋮ A modified hybrid conjugate gradient method for unconstrained optimization ⋮ Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations ⋮ 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

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-objective global optimal parafoil homing trajectory optimization via Gauss pseudospectral method
• A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
• Two modified HS type conjugate gradient methods for unconstrained optimization problems
• The convergence properties of some new conjugate gradient methods
• Efficient generalized conjugate gradient algorithms. I: Theory
• An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
• A new version of the Liu-Storey 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
• 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 Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
• 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: Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization