An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition

DOI10.1007/s40305-019-00257-wzbMath1488.49058OpenAlexW2958364786MaRDI QIDQ2240113

Reza Ghanbari, Xiao Liang Dong, Zhi-feng Dai, Xiang-Li Li

Publication date: 5 November 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00257-w

zbMATH Keywords

global convergenceconjugacy conditionthree-term conjugate gradient methodsufficient descent condition

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of quasi-Newton type (90C53) Numerical methods based on nonlinear programming (49M37)

Related Items (1)

Optimization problem for the integral model of developing systems

Uses Software

• SCALCG
• CGOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On three-term conjugate gradient algorithms for unconstrained optimization
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A Barzilai-Borwein conjugate gradient method
• Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
• An improved nonlinear conjugate gradient method with an optimal property
• Two modified three-term conjugate gradient methods with sufficient descent property
• New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• Multi-step nonlinear conjugate gradient methods for unconstrained minimization
• New quasi-Newton equation and related methods for unconstrained optimization
• Conjugate gradient methods with Armijo-type line searches.
• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
• An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
• A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
• A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
• A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
• A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
• A nonlinear conjugate gradient method based on the MBFGS secant condition
• Technical Note—A Modified Conjugate Gradient Algorithm
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Subspace Study on Conjugate Gradient Algorithms
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Some descent three-term conjugate gradient methods and their global convergence
• Convergence Conditions for Ascent Methods
• A descent family of Dai–Liao conjugate gradient methods
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.

This page was built for publication: An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition