An efficient mixed conjugate gradient method for solving unconstrained optimisation problems

DOI10.4208/EAJAM.140720.251220MaRDI QIDQ5014270zbMATH OpenOpenAlexFDO

Authors 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

conjugate gradient methodglobal convergencestrong Wolfe conditionssufficient descent

Mathematics Subject Classification ID

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

Recommendations

• New conjugate gradient method for unconstrained optimization
• A mixed conjugate gradient method for unconstrained optimization
• A new hybrid conjugate gradient algorithm for unconstrained optimization
• A new investigation of the conjugate gradient method for solving unconstrained optimization problems
• A conjugate gradient method with global convergence for large-scale unconstrained optimization problems

Cites work

• A class of globally convergent conjugate gradient methods
• A conjugate gradient method based on a modified secant relation for unconstrained optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• An efficient modified Polak-Ribière-Polyak conjugate gradient method with global convergence properties
• An unconstrained optimization test functions collection
• Benchmarking optimization software with performance profiles.
• Convergence properties of the Beale-Powell restart algorithm
• New conjugacy conditions and related nonlinear conjugate gradient methods
• New hybrid conjugate gradient method as a convex combination of LS and FR methods

Cited in

(4)

• A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A mixed conjugate gradient method for large scale problems
• A mixed conjugate gradient method for unconstrained optimization
• An efficient hybrid conjugate gradient method for unconstrained optimisation

This page was built for publication: An efficient mixed conjugate gradient method for solving unconstrained optimisation problems

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