Global convergence of a memory gradient method with nonmonotone technique for unconstrained optimization

zbMATH Open1143.65350MaRDI QIDQ5456436FDOQ5456436

Authors: Xiangyang He, Qi'an Chen 

Publication date: 4 April 2008

Recommendations

• Global convergence results of a three term memory gradient method with a non-monotone line search technique
• A memory gradient method based on the nonmonotone technique
• A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
• A memory gradient method with nonmonotone line search and its global convergence
• Global convergence of a memory gradient method for unconstrained optimization

zbMATH Keywords

global convergenceunconstrained optimizationnonmonotone line searchmemory gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Cited In (9)

• Global convergence of a memory gradient method without line search
• Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
• A memory gradient method based on the nonmonotone technique
• A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
• Strong global convergence of an adaptive nonmonotone memory gradient method
• Global convergence results of a three term memory gradient method with a non-monotone line search technique
• A memory gradient method with nonmonotone line search and its global convergence
• Global convergence of nonmonotone descent methods for unconstrained optimization problems
• Title not available (Why is that?)

Uses Software

• L-BFGS

This page was built for publication: Global convergence of a memory gradient method with nonmonotone technique for unconstrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5456436)