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

DOI10.1007/S12190-022-01821-ZMaRDI QIDQ6138360zbMATH OpenFDO

Authors Naima Hamel, Noureddine Benrabia, Mourad Ghiat, Hamza Guebbai

Publication date 5 September 2023

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

Full work available at URL https://doi.org/10.1007/S12190-022-01821-Z

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

• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 1243473 (Why is no real title available?)
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems
• A descent hybrid conjugate gradient method based on the memoryless BFGS update
• A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
• A hybrid of DL and WYL nonlinear conjugate gradient methods
• A hybridization of the Hestenes-Stiefel and Dai-Yuan conjugate gradient methods based on a least-squares approach
• A linear hybridization of Dai-Yuan and Hestenes-Stiefel conjugate gradient method for unconstrained optimization
• A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
• An efficient hybrid conjugate gradient method for unconstrained optimization
• An unconstrained optimization test functions collection
• Another hybrid conjugate gradient algorithm for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Convergence Conditions for Ascent Methods
• Convergence Conditions for Ascent Methods. II: Some Corrections
• Efficient generalized conjugate gradient algorithms. I: Theory
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• New hybrid conjugate gradient method as a convex combination of LS and CD methods
• New hybrid conjugate gradient method as a convex combination of LS and FR methods
• New hybrid conjugate gradient method as a convex combination of fr and PRP methods
• New hybrid conjugate gradient method for unconstrained optimization
• The conjugate gradient method in extremal problems

Cited in

(7)

• On an iterative Moser-Kurchatov method for solving systems of nonlinear equations
• Some three-term RMIL conjugate gradient methods with descent property for solving optimization problems with application
• Optimizing conjugate gradient methods: a study on the parameter c in the GDSHS algorithm
• On some Moser-type iterative methods with applications to nonlinear problems
• A improved spectral hybrid conjugate gradient method for unconstrained optimization
• A multi-step derivative-free projection method for nonlinear equations with application to sparse signal recovery
• Quasi-convex combination of three conjugate gradient directions

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

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