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

DOI10.1051/RO/2022200MaRDI QIDQ6186565zbMATH OpenOpenAlexFDO

Authors Mohammed Belloufi, Badreddine Sellami

Publication date 2 February 2024

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

Copyright license Creative Commons Attribution 4.0 International

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)

Recommendations

• New hybrid conjugate gradient method for unconstrained optimization
• A new hybrid CG method as convex combination
• A new hybrid conjugate gradient algorithm for unconstrained optimization
• A new hybrid conjugate gradient method for unconstrained optimization
• A new hybrid conjugate gradient method of unconstrained optimization methods

Cites work

• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• 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
• A literature survey of benchmark functions for global optimisation problems
• A survey of nonlinear conjugate gradient methods
• An efficient hybrid conjugate gradient method for unconstrained optimization
• An unconstrained optimization test functions collection
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient 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 fr and PRP methods
• New hybrid conjugate gradient method for unconstrained optimization
• Restart procedures for the conjugate gradient method
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
• The conjugate gradient method in extremal problems

Cited in

(2)

• Another hybrid conjugate gradient method as a convex combination of WYL and CD methods
• A new hybrid CG method as convex combination

This page was built for publication: An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms

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