A new variant of the memory gradient method for unconstrained optimization
type: Item
instance of: scholarly article
title: A new variant of the memory gradient method for unconstrained optimization
zbMATH Open document ID: 1258.90070
author: Yue Zheng
author: Zhongping Wan
published in: Optimization Letters
publication date: 2012-12-28T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 6119189
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: memory gradient method
zbMATH Keywords: line search
zbMATH Keywords: global convergence
zbMATH Keywords: convergence rate
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s11590-011-0355-6
OpenAlex ID: W2102823641
cites work: Handbook of applied optimization
cites work: Function minimization by conjugate gradients
cites work: The conjugate gradient method in extremal problems
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Convergence properties of the Fletcher-Reeves method
cites work: Convergence Properties of Algorithms for Nonlinear Optimization
cites work: A globally convergent version of the Polak-Ribière conjugate gradient method
cites work: Global convergence result for conjugate gradient methods
cites work: Encyclopedia of Optimization
cites work: Supermemory descent methods for unconstrained minimization
cites work: Q3626416
cites work: A supermemory gradient method for unconstrained optimization
cites work: On memory gradient method with trust region for unconstrained optimization
cites work: Relation between the memory gradient method and the Fletcher-Reeves method
cites work: A new supermemory gradient method for unconstrained optimization problems
cites work: Global convergence of a memory gradient method for unconstrained optimization
cites work: Testing Unconstrained Optimization Software
cites work: Q3539529
DOI: 10.1007/S11590-011-0355-6
Recommended article: Q3110681
Recommended article: Q3434776
Recommended article: A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
Recommended article: Q5426671
Recommended article: Q3016611
Recommended article: Q3169527
Recommended article: A new supermemory gradient method for unconstrained optimization problems
Recommended article: Q3108908
Recommended article: Global convergence of a memory gradient method for unconstrained optimization
Recommended article: Q3072256
description: scientific article; zbMATH DE number 6119189