A class of nonmonotone conjugate gradient methods for nonconvex functions

DOI10.1007/s11766-002-0047-1zbMath1006.65066OpenAlexW1993741432MaRDI QIDQ698383

Yun Liu, Zeng-xin Wei

Publication date: 4 March 2003

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-002-0047-1

zbMATH Keywords

unconstrained optimizationglobal convergencenonmonotone conjugate gradient methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Related Items (1)

Two hybrid nonlinear conjugate gradient methods based on a modified secant equation

Cites Work

• A class of nonmonotone conjugate gradient methods for unconstrained optimization
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• Global convergece of the bfgs algorithm with nonmonotone linesearch^∗∗this work is supported by national natural science foundation$ef:
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of nonmonotone conjugate gradient methods for nonconvex functions