New hyrid conjugate gradient method as a convex combination of HZ and CD methods

DOI10.1142/S1793557121501874OpenAlexW3134482843MaRDI QIDQ5013433

Mohammed Belloufi, Amira Hamdi, Badreddine Sellami

Publication date: 30 November 2021

Published in: Asian-European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793557121501874

zbMATH Keywords

unconstrained optimizationglobal convergencenumerical resultshybrid conjugate gradient method

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Related Items

A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hybrid conjugate gradient method for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• New imperfect conjugate gradient algorithm
• An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• New hybrid conjugate gradient method as a convex combination of FR and PRP methods
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• Benchmarking optimization software with performance profiles.

This page was built for publication: New hyrid conjugate gradient method as a convex combination of HZ and CD methods