A hybrid nonlinear conjugate gradient method for unconstrained optimization problems

zbMATH Open1353.90086MaRDI QIDQ2836070FDOQ2836070

P. Kaelo

Publication date: 7 December 2016

Published in: Pacific Journal of Optimization (Search for Journal in Brave)

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol12/p843.html

zbMATH Keywords

global convergenceweak Wolfe conditionshybrid conjugate gradient

Mathematics Subject Classification ID

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

Cited In (11)

• Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
• An efficient hybrid conjugate gradient method for unconstrained optimization
• An efficient hybrid conjugate gradient method for unconstrained optimization
• A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function
• Title not available (Why is that?)
• An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization
• Hybrid procedures for solving some unconstrained nonlinear optimization problems
• Nonlinear conjugate gradient methods for unconstrained optimization
• A hybrid nonlinear conjugate gradient method
• A hybrid Riemannian conjugate gradient method for nonconvex optimization problems
• A numerical study of some modified differential evolution algorithms

This page was built for publication: A hybrid nonlinear conjugate gradient method for unconstrained optimization problems

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