A modified hybrid conjugate gradient method for unconstrained optimization
type: Item
instance of: scholarly article
title: A modified hybrid conjugate gradient method for unconstrained optimization
zbMATH Open document ID: 1477.90102
DOI: 10.1155/2021/5597863
author: Yanyan Li
published in: Journal of Mathematics
publication date: 2021-06-23T00:00:00Z
review text: Summary: The nonlinear conjugate gradient algorithms are a very effective way in solving large-scale unconstrained optimization problems. Based on some famous previous conjugate gradient methods, a modified hybrid conjugate gradient method was proposed. The proposed method can generate decent directions at every iteration independent of any line search. Under the Wolfe line search, the proposed method possesses global convergence. Numerical results show that the modified method is efficient and robust.
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7362408
describes a project that uses: minpack
MaRDI profile type: MaRDI publication profile
full work available at URL: https://doi.org/10.1155/2021/5597863
OpenAlex ID: W3131790919
cites work: Function minimization by conjugate gradients
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Methods of conjugate gradients for solving linear systems
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Q4226179
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: New hybrid conjugate gradient method as a convex combination of LS and FR methods
cites work: A hybrid conjugate gradient method with descent property for unconstrained optimization
cites work: A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
cites work: Two mixed conjugate gradient methods based on DY
cites work: The global convergence of a mixed conjugate gradient method with the Wolfe line search
cites work: Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
cites work: The convergence properties of some new conjugate gradient methods
cites work: The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
cites work: A note about WYL's conjugate gradient method and its applications
cites work: Q4900512
cites work: A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
cites work: Two conjugate gradient methods with sufficient descent property
cites work: An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
cites work: Testing Unconstrained Optimization Software
cites work: Benchmarking optimization software with performance profiles.
Recommended article: A modified conjugate gradient method for unconstrained optimization
Recommended article: An efficient hybrid conjugate gradient method for unconstrained optimization
Recommended article: A new hybrid conjugate gradient method for unconstrained optimization
Recommended article: An efficient hybrid conjugate gradient method for unconstrained optimisation
Recommended article: Another hybrid conjugate gradient method for unconstrained optimization problems
Recommended article: Hybrid conjugate gradient methods for unconstrained optimization
Recommended article: A new hybrid conjugate gradient method of unconstrained optimization methods
copyright license: Creative Commons Attribution 4.0 International
description: scientific article; zbMATH DE number 7362408