Hybrid conjugate gradient methods for unconstrained optimization

DOI10.1080/10556780500518653zbMath1119.90073MaRDI QIDQ5758224

Neng-Zhu Gu, Jiangtao Mo, Zeng-xin Wei

Publication date: 3 September 2007

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780500518653

zbMATH Keywords

unconstrained optimization; convergence; Wolfe line search; conjugate gradient

Mathematics Subject Classification ID

90C30: Nonlinear programming

90C52: Methods of reduced gradient type

Related Items

Nonlinear conjugate gradient method for spectral tomosynthesis, Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications, A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection, An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems, A variant of trust-region methods for unconstrained optimization, A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems

Cites Work

• Unnamed Item
• Efficient hybrid conjugate gradient techniques
• Optimization. Algorithms and consistent approximations
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Testing Unconstrained Optimization Software
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• The conjugate gradient method in extremal problems
• An efficient hybrid conjugate gradient method for unconstrained optimization