A new supermemory gradient method with a multi-step curve search rule

MaRDI QIDQ2885676zbMATH OpenFDO

Authors Jingyong Tang, Li Dong, Guoping He

Publication date 1 June 2012

Published in Acta Mathematicae Applicatae Sinica (Search for Journal in Brave)

zbMATH Keywords

curve searchglobal convergencelinear convergence rateunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A new super-memory gradient method with curve search rule
• A new memory gradient method with curve search rule
• A new memory gradient method with curve search rule
• A new class of supermemory gradient methods
• A new supermemory gradient method for unconstrained optimization problems
• A supermemory gradient method based on the nonmonotone technique
• A supermemory gradient method without line search
• scientific article; zbMATH DE number 5926962
• A supermemory gradient method for unconstrained optimization
• scientific article; zbMATH DE number 2150661

Cited in

(6)

• A new supermemory gradient method for unconstrained optimization problems
• A new super-memory gradient method with curve search rule
• scientific article; zbMATH DE number 5926962 (Why is no real title available?)
• A new class of multi-step descent methods with curve search rule
• A new memory gradient method with curve search rule
• A supermemory gradient method without line search

This page was built for publication: A new supermemory gradient method with a multi-step curve search rule

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