A new hybrid conjugate gradient method of unconstrained optimization methods

DOI10.1142/S179355712250070XzbMath1487.90644OpenAlexW3174270087MaRDI QIDQ5865970

Sellami Badreddine, Belloufi Mohammed, Chenna Nasreddine

Publication date: 10 June 2022

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

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

zbMATH Keywords

global convergenceconjugate gradientline searchnonlinear optimization unconstrained

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hybrid conjugate gradient method for unconstrained optimization
• A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• A conjugate gradient method for unconstrained optimization problems
• Efficient hybrid conjugate gradient techniques
• New hybrid conjugate gradient method as a convex combination of LS and FR methods
• An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• 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
• Methods of conjugate gradients for solving linear systems
• Comments on ”New hybrid conjugate gradient method as a convex combination of FR and PRP methods”
• Benchmarking optimization software with performance profiles.