An Efficient Mixed Conjugate Gradient Method for Solving Unconstrained Optimisation Problems

DOI10.4208/eajam.140720.251220zbMath1475.90036OpenAlexW3131523418MaRDI QIDQ5014270

P. Mtagulwa, P. Kaelo

Publication date: 1 December 2021

Published in: East Asian Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/eajam.140720.251220

zbMATH Keywords

global convergenceconjugate gradient methodsufficient descentstrong Wolfe conditions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Related Items

A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization

Cites Work

• Unnamed Item
• A class of globally convergent conjugate gradient methods
• Convergence properties of the Beale-Powell restart algorithm
• New hybrid conjugate gradient method as a convex combination of LS and FR methods
• An efficient modified Polak–Ribière–Polyak conjugate gradient method with global convergence properties
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Conjugate Gradient Method Based on a Modified Secant Relation for Unconstrained Optimization
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.