Convergence of Liu-Storey conjugate gradient method
type: Item
instance of: scholarly article
title: Convergence of Liu-Storey conjugate gradient method
zbMATH Open document ID: 1121.90125
author: Zhenjun Shi
author: Jie Shen
published in: European Journal of Operational Research
publication date: 2007-05-30T00:00:00Z
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 5159520
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: Liu-Storey conjugate gradient method
zbMATH Keywords: global convergence
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.09.066
OpenAlex ID: W2064006173
cites work: Minimization of functions having Lipschitz continuous first partial derivatives
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Global convergence of a two-parameter family of conjugate gradient methods without line search
cites work: New properties of a nonlinear conjugate gradient method
cites work: Q3129102
cites work: Convergence properties of the Fletcher-Reeves method
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Convergence Properties of Nonlinear Conjugate Gradient Methods
cites work: Q4226179
cites work: Function minimization by conjugate gradients
cites work: Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
cites work: Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
cites work: A globally convergent version of the Polak-Ribière conjugate gradient method
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
cites work: Methods of conjugate gradients for solving linear systems
cites work: Global convergence result for conjugate gradient methods
cites work: Efficient generalized conjugate gradient algorithms. I: Theory
cites work: Numerical Optimization
cites work: Q5563083
cites work: The conjugate gradient method in extremal problems
cites work: Global convergence of conjugate gradient methods without line search
cites work: Quadratic cost flow and the conjugate gradient method
cites work: On the Convergence of a New Conjugate Gradient Algorithm
cites work: Q4928358
cites work: Convergence of descent method without line search
cites work: Step-size estimation for unconstrained optimization methods
DOI: 10.1016/J.EJOR.2006.09.066
description: scientific article; zbMATH DE number 5159520