Three-term conjugate gradient methods based on secant conditions for unconstrained optimization

MaRDI QIDQ3007185zbMATH OpenFDO

Authors Yasushi Narushima, Kaori Sugiki, Hiroshi Yabe

Publication date 21 June 2011

zbMATH Keywords

global convergence

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30)

Recommendations

• Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• Some three-term conjugate gradient methods for solving unconstrained optimization problems

Cited in

(4)

• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• Conjugate gradient methods based on secant conditions that generate descent search directions for unconstrained optimization
• Descent three-term conjugate gradient methods based on secant conditions for unconstrained optimization
• Some three-term conjugate gradient methods for solving unconstrained optimization problems

This page was built for publication: Three-term conjugate gradient methods based on secant conditions for unconstrained optimization

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