A class of nonmonotone conjugate gradient methods for unconstraint optimization

MaRDI QIDQ3071985zbMATH OpenFDO

Authors Zhongbo Sun, Fujian Duan

Publication date 5 February 2011

zbMATH Keywords

numerical resultsglobal convergenceconjugate gradient methodnonmonotone line searchlarge scale optimization problems

Mathematics Subject Classification ID

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

Recommendations

• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• A new family of conjugate gradient methods
• New conjugate gradient method for unconstrained optimization
• New iterative conjugate gradient method for nonlinear unconstrained optimization
• A new family of globally convergent conjugate gradient methods

Cited in

(6)

• scientific article; zbMATH DE number 686911 (Why is no real title available?)
• An accelerated monotonic convergent algorithm for a class of non-Lipschitzian NCP\((F)\) involving an \(M\)-matrix
• scientific article; zbMATH DE number 1376891 (Why is no real title available?)
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• A new family of conjugate gradient methods
• A monotone gradient method via weak secant equation for unconstrained optimization

This page was built for publication: A class of nonmonotone conjugate gradient methods for unconstraint optimization

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