The memory gradient methods for unconstrained optimization

zbMATH Open1115.65067MaRDI QIDQ3434776FDOQ3434776

Authors: Yasushi Narushima, Hiroshi Yabe 

Publication date: 3 May 2007

Recommendations

• A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
• scientific article; zbMATH DE number 5210992
• Global convergence of a memory gradient method for unconstrained optimization
• A new memory gradient method and its convergence
• A new class of memory gradient methods and its global convergence

zbMATH Keywords

global convergenceunconstrained optimizationnumerical experimentslarge scale problemsWolfe line search strategymemory gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Cited In (10)

• Global convergence of a memory gradient method for unconstrained optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION
• Title not available (Why is that?)
• A memory efficient incremental gradient method for regularized minimization
• A new variant of the memory gradient method for unconstrained optimization
• Constructing memory-minimizing schedules for multifrontal methods
• On memory gradient method with trust region for unconstrained optimization
• Memory gradient method for multiobjective optimization

This page was built for publication: The memory gradient methods for unconstrained optimization

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