Efficient descent direction of a conjugate gradient algorithm for nonlinear optimization

MaRDI QIDQ6966411zbMATH OpenFDO

Authors Mohamed Lamine Ouaoua, Samia Khelladi

Publication date 27 June 2025

Published in Nonlinear Dynamics and Systems Theory (Search for Journal in Brave)

Full work available at URL http://e-ndst.kiev.ua/v25n1/9(97).pdf

zbMATH Keywords

global convergenceunconstrained optimizationconjugate gradient methoddescent directioninexact line search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Cites work

• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• 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 new family of globally convergent conjugate gradient methods
• A survey of nonlinear conjugate gradient methods
• An efficient hybrid conjugate gradient method for unconstrained optimization
• An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New conjugate gradient method for unconstrained optimization
• New hybrid conjugate gradient method as a convex combination of LS and FR methods
• New iterative conjugate gradient method for nonlinear unconstrained optimization
• Nonlinear conjugate gradient methods for unconstrained optimization
• The conjugate gradient method in extremal problems

This page was built for publication: Efficient descent direction of a conjugate gradient algorithm for nonlinear optimization

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