A new hybrid conjugate gradient method and its global convergence for unconstrained optimization

zbMATH Open1210.90161MaRDI QIDQ3078091FDOQ3078091

Authors: Shaogang Li, Zhongbo Sun 

Publication date: 18 February 2011

Recommendations

• A new hybrid conjugate gradient algorithm for unconstrained optimization
• New hybrid conjugate gradient method for unconstrained optimization
• A class hybrid parameter conjugate gradient for unconstrained optimization
• A hybrid and parameter conjugate gradient method for unconstrained optimization and global convergence
• A hybrid nonlinear conjugate gradient method for unconstrained optimization problems

zbMATH Keywords

sufficient descent directionlarge scale matrixquasi-Newton matrix

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (8)

• New hybrid conjugate gradient method as a convex combination of LS and CD methods
• A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
• Title not available (Why is that?)
• A globally convergent hybrid conjugate gradient method with strong Wolfe conditions for unconstrained optimization
• Another hybrid conjugate gradient method as a convex combination of WYL and CD methods
• Developing a new conjugate gradient algorithm with the benefit of some desirable properties of the Newton algorithm for unconstrained optimization
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• New DY-HS hybrid conjugate gradient algorithm for solving optimization problem of unsteady partial differential equations with convection term

Uses Software

• minpack

This page was built for publication: A new hybrid conjugate gradient method and its global convergence for unconstrained optimization

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