A new descent memory gradient method and its global convergence
type: Item
instance of: scholarly article
title: A new descent memory gradient method and its global convergence
zbMATH Open document ID: 1263.90128
author: M. Sun
author: Qingguo Bai
published in: Journal of Systems Science and Complexity
publication date: 2013-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6133207
zbMATH Keywords: global convergence
zbMATH Keywords: memory gradient method
zbMATH Keywords: sufficiently descent
MaRDI profile type: Publication
full work available at URL: s11424-011-8150-0
OpenAlex ID: W2061960946
cites work: Q3626416
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: Convergence of Liu-Storey conjugate gradient method
cites work: A Two-Term PRP-Based Descent Method
cites work: Convergence of the Polak-Ribiére-Polyak conjugate gradient method
cites work: Methods of conjugate gradients for solving linear systems
cites work: Function minimization by conjugate gradients
cites work: The conjugate gradient method in extremal problems
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: The convergence properties of some new conjugate gradient methods
cites work: Q5440501
cites work: On the convergence of a new hybrid projection algorithm
cites work: Convergence properties of the dependent PRP conjugate gradient methods
cites work: A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
DOI: 10.1007/S11424-011-8150-0
description: scientific article; zbMATH DE number 6133207