Global convergence of some modified PRP nonlinear conjugate gradient methods

DOI10.1007/s11590-010-0224-8zbMath1228.90153OpenAlexW2001931732MaRDI QIDQ644512

Zhi-feng Dai, Bo-Shi Tian

Publication date: 4 November 2011

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-010-0224-8

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodline searchsufficient descent property

Mathematics Subject Classification ID

Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items

Spectral method and its application to the conjugate gradient method ⋮ A short note on the global convergence of the unmodified PRP method ⋮ Nonlinear conjugate gradient methods with Wolfe type line search ⋮ A new modified three-term conjugate gradient method with sufficient descent property and its global convergence ⋮ A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence ⋮ Adaptive type-2 neural fuzzy sliding mode control of a class of nonlinear systems ⋮ Conjugate gradient type methods for the nondifferentiable convex minimization ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search ⋮ Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence ⋮ A limited memory descent Perry conjugate gradient method ⋮ A descent conjugate gradient algorithm for optimization problems and its applications in image restoration and compression sensing ⋮ A modified nonlinear conjugate gradient method with the Armijo line search and its application ⋮ Unnamed Item ⋮ A new efficient conjugate gradient method for unconstrained optimization ⋮ A conjugate gradient algorithm and its applications in image restoration ⋮ A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method ⋮ Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
• 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
• Convergence properties of the Fletcher-Reeves method
• 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.