A descent method for unconstrained optimization problems

MaRDI QIDQ3193952zbMATH OpenFDO

Authors Li Dong, Jinchuan Zhou

Publication date 28 October 2015

zbMATH Keywords

convergenceunconstrained optimizationmemory gradient methodcurve search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• A descent algorithm without line search for unconstrained optimization
• A new descent algorithm with curve search rule
• A simple sufficient descent method for unconstrained optimization
• scientific article; zbMATH DE number 1960973
• Convergence of descent method without line search

Cited in

(13)

• scientific article; zbMATH DE number 1960973 (Why is no real title available?)
• A new method with sufficient descent property for unconstrained optimization
• Greatest descent algorithms in unconstrained optimization
• A reduced-space line-search method for unconstrained optimization via random descent directions
• Global descent methods for unconstrained global optimization
• Convergence of descent method without line search
• scientific article; zbMATH DE number 465313 (Why is no real title available?)
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
• A new descent algorithm with curve search rule
• A descent algorithm without line search for unconstrained optimization
• Choosing descent directions in unconstrained minimization problems
• A new class of multi-step descent methods with curve search rule
• Variations of the steepest descent method in nonrestricted optimization

This page was built for publication: A descent method for unconstrained optimization problems

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