A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems

DOI10.1007/S12190-022-01821-ZzbMath1518.90047MaRDI QIDQ6138360

Hamza Guebbai, Mourad Ghiat, Noureddine Benrabia, Naima Hamel

Publication date: 5 September 2023

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

global convergenceconjugate gradient methodhybrid methodNewton directionunconstraind optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Newton-type methods (49M15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hybrid conjugate gradient method for unconstrained optimization
• Efficient generalized conjugate gradient algorithms. I: Theory
• A descent hybrid conjugate gradient method based on the memoryless BFGS update
• A hybrid of DL and WYL nonlinear conjugate gradient methods
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
• New hybrid conjugate gradient method as a convex combination of LS and FR methods
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems
• A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• New hybrid conjugate gradient method as a convex combination of LS and CD methods
• A Linear Hybridization of Dai-Yuan and Hestenes-Stiefel Conjugate Gradient Method for Unconstrained Optimization
• New hybrid conjugate gradient method as a convex combination of FR and PRP methods
• Function minimization by conjugate gradients
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization

This page was built for publication: A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems