New hybrid conjugate gradient method as a convex combination of LS and CD methods
From MaRDI portal
Publication:4956622
DOI10.2298/FIL1706813DzbMath1488.90185MaRDI QIDQ4956622
Publication date: 2 September 2021
Published in: Filomat (Search for Journal in Brave)
Related Items (3)
A new hybrid conjugate gradient algorithm based on the Newton direction to solve unconstrained optimization problems ⋮ An efficient new hybrid CG-method as convex combination of DY and CD and HS algorithms ⋮ An Efficient Hybrid Conjugate Gradient Method for Unconstrained Optimisation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- Global convergence result for conjugate gradient methods
- A global convergence of LS-CD hybrid conjugate gradient method
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Numerical Optimization
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence properties of the Fletcher-Reeves method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- New hybrid conjugate gradient method as a convex combination of FR and PRP methods
- Function minimization by conjugate gradients
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: New hybrid conjugate gradient method as a convex combination of LS and CD methods
