An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms

DOI10.1051/ro/2022200OpenAlexW4308944265MaRDI QIDQ6186565

Badreddine Sellami, Mohammed Belloufi, Unnamed Author

Publication date: 2 February 2024

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2022200

zbMATH Keywords

hybrid conjugate gradient methodsufficient descent conditionstrong Wolfe line searchunconstrained optimization problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hybrid conjugate gradient method for unconstrained optimization
• A literature survey of benchmark functions for global optimisation problems
• Efficient generalized conjugate gradient algorithms. I: Theory
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
• A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• Restart procedures for the conjugate gradient method
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• New hybrid conjugate gradient method as a convex combination of LS and CD methods
• An efficient hybrid conjugate gradient method for unconstrained optimization
• New hybrid conjugate gradient method as a convex combination of FR and PRP methods
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods. II: Some Corrections
• 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.