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

DOI10.1515/TAA-2022-0112MaRDI QIDQ2158266zbMATH OpenOpenAlexFDO

Authors T. Diphofu, P. Kaelo, Abebe Regassa Tufa

Publication date 26 July 2022

Published in Topological Algebra and its Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1515/taa-2022-0112

zbMATH Keywords

conjugate gradientglobal convergencesufficient descentweak Wolfe line search

Mathematics Subject Classification ID

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

Recommendations

• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
• A hybrid nonlinear conjugate gradient method for unconstrained optimization problems
• A hybrid conjugate gradient method with descent property for unconstrained optimization
• A new three-term conjugate gradient method with descent direction for unconstrained optimization

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 class of globally convergent three-term Dai-Liao conjugate gradient methods
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
• A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions
• A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization
• A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
• A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
• An efficient adaptive three-term extension of the Hestenes-Stiefel conjugate gradient method
• An efficient mixed conjugate gradient method for solving unconstrained optimisation problems
• An improved nonlinear conjugate gradient method with an optimal property
• An unconstrained optimization test functions collection
• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
• Behavior of the combination of PRP and HZ methods for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New hyrid conjugate gradient method as a convex combination of HZ and CD methods
• Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
• Some descent three-term conjugate gradient methods and their global convergence
• Some three-term conjugate gradient methods with the new direction structure
• The conjugate gradient method in extremal problems
• Updating Quasi-Newton Matrices with Limited Storage

Cited in

(8)

• A modified three-term conjugate gradient method with sufficient descent property
• Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization
• A sufficient descent three-term conjugate gradient method via symmetric rank-one update for large-scale optimization
• A class of globally convergent three-term Dai-Liao conjugate gradient methods
• Three-term modified LS conjugate gradient method with its global convergence
• A family of hybrid conjugate gradient methods for unconstrained optimization
• A scaled three-term conjugate gradient method for unconstrained optimization
• A new three-term conjugate gradient method with descent direction for unconstrained optimization

This page was built for publication: A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization

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