Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
type: Item
instance of: scholarly article
title: Modified nonlinear conjugate gradient method with sufficient descent condition for unconstrained optimization
zbMATH Open document ID: 1276.90054
DOI: 10.1186/1029-242X-2011-57
author: Shaoheng Wang
author: Jinkui Liu
published in: Journal of Inequalities and Applications
publication date: 2013-07-30T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 65H10
zbMATH DE Number: 6192562
zbMATH Keywords: line search
zbMATH Keywords: global convergence
Wikidata QID: Q59268578
MaRDI profile type: Publication
cites work: The conjugate gradient method in extremal problems
cites work: A descent nonlinear conjugate gradient method for large-scale unconstrained optimization
cites work: Scaled conjugate gradient algorithms for unconstrained optimization
cites work: Another nonlinear conjugate gradient algorithm for unconstrained optimization
cites work: A spectral conjugate gradient method for unconstrained optimization
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
cites work: New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
cites work: New quasi-Newton methods for unconstrained optimization problems
cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
cites work: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
cites work: Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
cites work: Testing Unconstrained Optimization Software
full work available at URL: 1029-242x-2011-57
OpenAlex ID: W2130053177
description: scientific article; zbMATH DE number 6192562