A supermemory gradient method without line search

MaRDI QIDQ3193996zbMATH OpenFDO

Authors Yuanwen Liu, Wei Ma, Yigui Ou

Publication date 28 October 2015

zbMATH Keywords

fixed step-lengthnumerical experimentsupermemory gradient methodunconstrained optimization

Mathematics Subject Classification ID

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

Recommendations

• A supermemory gradient method for unconstrained optimization
• A new supermemory gradient method for unconstrained optimization problems
• scientific article; zbMATH DE number 2150661
• A new supermemory gradient method with a multi-step curve search rule
• scientific article; zbMATH DE number 6001285

Cited in

(8)

• A new supermemory gradient method for unconstrained optimization problems
• Convergence of supermemory gradient method
• A supermemory gradient method for unconstrained optimization
• A new supermemory gradient method with a multi-step curve search rule
• scientific article; zbMATH DE number 5926962 (Why is no real title available?)
• scientific article; zbMATH DE number 6001285 (Why is no real title available?)
• scientific article; zbMATH DE number 2150661 (Why is no real title available?)
• scientific article; zbMATH DE number 5210992 (Why is no real title available?)

This page was built for publication: A supermemory gradient method without line search

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