A new hybrid CG method as convex combination

DOI10.3934/MFC.2023028MaRDI QIDQ6633217zbMATH OpenFDO

Authors Mohammed Belloufi, Badreddine Sellami

Publication date 5 November 2024

Published in Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/MFC.2023028

zbMATH Keywords

globale convergencehybrid conjugate gradient methodnumerical resultsunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
• A new hybrid conjugate gradient method of unconstrained optimization methods
• New hybrid conjugate gradient method for unconstrained optimization
• A new hybrid conjugate gradient algorithm for unconstrained optimization
• A hybrid nonlinear conjugate gradient method for unconstrained optimization problems

Cites work

• A literature survey of benchmark functions for global optimisation problems
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A survey of nonlinear conjugate gradient methods
• An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
• An unconstrained optimization test functions collection
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• Behavior of the combination of PRP and HZ methods for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Efficient generalized conjugate gradient algorithms. I: Theory
• Efficient hybrid conjugate gradient techniques
• Function minimization by conjugate gradients
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• New hybrid conjugate gradient method as a convex combination of fr and PRP methods
• New hybrid conjugate gradient method as a convex combination of LS and CD methods
• New hybrid conjugate gradient method as a convex combination of LS and FR methods
• New hybrid conjugate gradient method for unconstrained optimization
• The conjugate gradient method in extremal problems

Cited in

(2)

• An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
• An optimized conjugate gradient method for unconstrained optimization and its application in sparse signal recovery

This page was built for publication: A new hybrid CG method as convex combination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633217)