Global convergence of a modified conjugate gradient method

DOI10.1186/1029-242X-2014-248zbMath1372.90086WikidataQ59323507 ScholiaQ59323507MaRDI QIDQ2405656

Xuesha Wu

Publication date: 26 September 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodsufficient descent condition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Numerical computation of solutions to systems of equations (65H10)

Uses Software

• CUTEr
• CUTE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence properties of a class of nonlinear conjugate gradient methods
• The convergence properties of some new conjugate gradient methods
• Efficient generalized conjugate gradient algorithms. I: Theory
• A globally convergent version of the Polak-Ribière conjugate gradient method
• Global convergence of a modified LS method
• A new version of the Liu-Storey conjugate gradient method
• Convergence Properties of Algorithms for Nonlinear Optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• CUTE
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• The conjugate gradient method in extremal problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: Global convergence of a modified conjugate gradient method