New hybrid conjugate gradient method as a convex combination of FR and PRP methods

DOI10.2298/FIL1611083DzbMath1474.90437OpenAlexW1034108409MaRDI QIDQ5279585

Snežana S. Djordjević

Publication date: 19 July 2017

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1611083d

zbMATH Keywords

convex combinationconjugacy conditionhybrid conjugate gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

New hybrid conjugate gradient method as a convex combination of LS and FR methods, A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems, An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms, New hybrid conjugate gradient method as a convex combination of LS and CD methods, Behavior of the combination of PRP and HZ methods for unconstrained optimization, New hyrid conjugate gradient method as a convex combination of HZ and CD methods, Comments on ”New hybrid conjugate gradient method as a convex combination of FR and PRP methods”, A new hybrid conjugate gradient method of unconstrained optimization methods