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

DOI10.1515/TAA-2022-0112zbMATH Open1492.90084OpenAlexW4285144758MaRDI QIDQ2158266FDOQ2158266

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)

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

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

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)

Cites Work

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

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)