A class of nonmonotone conjugate gradient methods for unconstrained optimization
type: Item
instance of: scholarly article
title: A class of nonmonotone conjugate gradient methods for unconstrained optimization
zbMATH Open document ID: 0956.90047
DOI: 10.1023/A:1021723128049
author: K. Appert
published in: Journal of Optimization Theory and Applications
publication date: 1999-06-29T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C52
Mathematics Subject Classification ID: 49M37
zbMATH DE Number: 1310609
zbMATH Keywords: nonmonotone conjugate gradient method
zbMATH Keywords: nonmonotone line search
zbMATH Keywords: global convergence
zbMATH Keywords: unconstrained optimization
MaRDI profile type: Publication
cites work: Function minimization by conjugate gradients
cites work: Q3313210
cites work: Efficient hybrid conjugate gradient techniques
cites work: Restart procedures for the conjugate gradient method
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Q4103338
cites work: Q4312995
cites work: An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
cites work: A Nonmonotone Line Search Technique for Newton’s Method
cites work: Global convergece of the bfgs algorithm with nonmonotone linesearch∗∗this work is supported by national natural science foundation$ef:
cites work: Q4016506
full work available at URL: a:1021723128049
OpenAlex ID: W194445265
description: scientific article; zbMATH DE number 1310609