A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION

DOI10.3846/13926292.2016.1176965zbMath1488.49059OpenAlexW2404120536WikidataQ57952613 ScholiaQ57952613MaRDI QIDQ5011628

Saman Babaie-Kafaki, Yu Bo He, Xiao Liang Dong, Reza Ghanbari, Hong-Wei Liu

Publication date: 27 August 2021

Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3846/13926292.2016.1176965

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate 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 (3)

A modified sufficient descent Polak-Ribiére-Polyak type conjugate gradient method for unconstrained optimization problems ⋮ A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method

Cites Work

• Unnamed Item
• On three-term conjugate gradient algorithms for unconstrained optimization
• A simple three-term conjugate gradient algorithm for unconstrained optimization
• A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
• Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
• New version of the three-term conjugate gradient method based on spectral scaling conjugacy condition that generates descent search direction
• A new class of spectral conjugate gradient methods based on a modified secant equation for unconstrained optimization
• A hybridization of the Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
• A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
• A modified Perry conjugate gradient method and its global convergence
• 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 descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• On the Convergence of a New Conjugate Gradient Algorithm
• CUTE
• TWO MODIFIED HYBRID CONJUGATE GRADIENT METHODS BASED ON A HYBRID SECANT EQUATION
• 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
• A Two-Term PRP-Based Descent Method
• Convergence Conditions for Ascent Methods
• The conjugate gradient method in extremal problems
• 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: A NEW THREE–TERM CONJUGATE GRADIENT METHOD WITH DESCENT DIRECTION FOR UNCONSTRAINED OPTIMIZATION