Two Modified Polak–Ribière–Polyak-Type Nonlinear Conjugate Methods with Sufficient Descent Property

DOI10.1080/01630563.2010.498597zbMath1202.90239OpenAlexW2164044293MaRDI QIDQ3058361

Zhi-feng Dai

Publication date: 19 November 2010

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2010.498597

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodR-linear convergence

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

A descent extension of the Polak-Ribière-Polyak conjugate gradient method, A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions, A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem, A new method with sufficient descent property for unconstrained optimization, A modified three-term conjugate gradient method with sufficient descent property

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of the Polak-Ribiére-Polyak conjugate gradient method
• Efficient generalized conjugate gradient algorithms. I: Theory
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• 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
• Global Convergence Properties of Conjugate Gradient Methods for 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
• Benchmarking optimization software with performance profiles.