A Linear Hybridization of Dai-Yuan and Hestenes-Stiefel Conjugate Gradient Method for Unconstrained Optimization

DOI10.4208/NMTMA.OA-2020-0056zbMath1488.65141OpenAlexW3121506184MaRDI QIDQ5017515

Sindhu Narayanan, P. Kaelo

Publication date: 17 December 2021

Published in: Numerical Mathematics: Theory, Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/nmtma.oa-2020-0056

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Related Items (1)

A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems

This page was built for publication: A Linear Hybridization of Dai-Yuan and Hestenes-Stiefel Conjugate Gradient Method for Unconstrained Optimization