Global convergence of a memory gradient method for unconstrained optimization
type: Item
instance of: scholarly article
title: Global convergence of a memory gradient method for unconstrained optimization
zbMATH Open document ID: 1128.90059
author: Yasushi Narushima
author: Hiroshi Yabe
published in: Computational Optimization and Applications
publication date: 2007-01-29T00:00:00Z
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 5119579
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: memory gradient method
zbMATH Keywords: descent search direction
zbMATH Keywords: Wolfe conditions
zbMATH Keywords: global convergence
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: s10589-006-8719-z
OpenAlex ID: W1975553457
cites work: Q5691088
cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
cites work: Study on a supermemory gradient method for the minimization of functions
cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization
cites work: A truncated Newton method with non-monotone line search for unconstrained optimization
cites work: Memory gradient method for the minimization of functions
cites work: Testing Unconstrained Optimization Software
cites work: Line search algorithms with guaranteed sufficient decrease
cites work: A conjugate direction algorithm without line searches
cites work: Updating Quasi-Newton Matrices with Limited Storage
cites work: Numerical Optimization
cites work: New quasi-Newton equation and related methods for unconstrained optimization
cites work: Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
DOI: 10.1007/S10589-006-8719-Z
description: scientific article; zbMATH DE number 5119579