A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
type: Item
instance of: scholarly article
title: A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
zbMATH Open document ID: 1452.90321
author: P. Kaelo
author: P. Mtagulwa
author: M. Thuto
published in: Mathematical Sciences
publication date: 2020-05-28T00:00:00Z
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 7206069
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: global convergence
zbMATH Keywords: sufficient descent
zbMATH Keywords: strong Wolfe conditions
MaRDI profile type: MaRDI publication profile
full work available at URL: s40096-019-00310-y
OpenAlex ID: W2984487147
cites work: An efficient modified Polak–Ribière–Polyak conjugate gradient method with global convergence properties
cites work: Q3539529
cites work: A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Benchmarking optimization software with performance profiles.
cites work: New hybrid conjugate gradient method as a convex combination of LS and FR methods
cites work: A modified spectral conjugate gradient method with global convergence
cites work: Q4226179
cites work: Function minimization by conjugate gradients
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: The Limited Memory Conjugate Gradient Method
cites work: Methods of conjugate gradients for solving linear systems
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 hybrid conjugate gradient method with descent property for unconstrained optimization
cites work: New hybrid conjugate gradient method for unconstrained optimization
cites work: A nonmonotone hybrid conjugate gradient method for unconstrained optimization
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Efficient hybrid conjugate gradient techniques
cites work: The convergence properties of some new conjugate gradient methods
cites work: A note about WYL's conjugate gradient method and its applications
cites work: A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
DOI: 10.1007/S40096-019-00310-Y
Recommended article: GLOBAL CONVERGENCE OF AN EFFICIENT HYBRID CONJUGATE GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
Recommended article: Q3078091
Recommended article: A hybrid and parameter conjugate gradient method for unconstrained optimization and global convergence
Recommended article: Q4900512
Recommended article: Q5319243
Recommended article: An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
Recommended article: An efficient hybrid conjugate gradient method for unconstrained optimization
Recommended article: A new globally convergent conjugate gradient method with Wolfe line search
Recommended article: A conjugate gradient method with global convergence for large-scale unconstrained optimization problems
description: scientific article; zbMATH DE number 7206069