Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems

DOI10.1007/s11590-008-0086-5zbMath1154.90623MaRDI QIDQ1001321

Gong Lin Yuan

Publication date: 17 February 2009

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

Full work available at URL: https://doi.org/10.1007/s11590-008-0086-5

zbMATH Keywords

unconstrained optimization; conjugate gradient method; line search; sufficient descent

Mathematics Subject Classification ID

90C06: Large-scale problems in mathematical programming

90C52: Methods of reduced gradient type

Uses Software

• CG_DESCENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
• The convergence properties of some new conjugate gradient methods
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• Convergence Properties of Algorithms for Nonlinear Optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Algorithm 851
• 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
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.