A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
From MaRDI portal
Publication:5425803
DOI10.15807/jorsj.50.31zbMath1278.90387OpenAlexW570292285MaRDI QIDQ5425803
Publication date: 14 November 2007
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.50.31
optimizationglobal convergencenonlinear programmingnonmonotone line searchlarge scale problemsmemory gradient method
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)
Related Items (1)
This page was built for publication: A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION