A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems
DOI10.1007/S12190-022-01821-ZzbMATH Open1518.90047MaRDI QIDQ6138360FDOQ6138360
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)
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
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- An unconstrained optimization test functions collection
- Title not available (Why is that?)
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- 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
- Efficient generalized conjugate gradient algorithms. I: Theory
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Title not available (Why is that?)
- New hybrid conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
- A hybridization of the Hestenes–Stiefel and Dai–Yuan conjugate gradient methods based on a least-squares approach
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- A hybrid of DL and WYL nonlinear conjugate gradient 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
- A hybrid FR-DY conjugate gradient algorithm for unconstrained optimization with application in portfolio selection
- A decent three term conjugate gradient method with global convergence properties for large scale unconstrained optimization problems
- 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
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)
