A new family of globally convergent conjugate gradient methods

DOI10.1007/s10479-016-2120-9zbMath1348.90629OpenAlexW2256165223MaRDI QIDQ333105

Y. Chaib, Badreddine Sellami

Publication date: 9 November 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2120-9

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodline search

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Combinatorial optimization (90C27) Methods of reduced gradient type (90C52)

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• A class of globally convergent conjugate gradient methods
• On the convergence property of the DFP algorithm
• Global convergence result for conjugate gradient methods
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Testing Unconstrained Optimization Software
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Conjugate Gradient Methods with Inexact Searches
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Convergence properties of the Fletcher-Reeves method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A new two-parameter family of nonlinear conjugate gradient methods
• Function minimization by conjugate gradients
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• An efficient hybrid conjugate gradient method for unconstrained optimization