A family of hybrid conjugate gradient methods for unconstrained optimization
From MaRDI portal
Publication:4806389
DOI10.1090/S0025-5718-03-01491-1zbMath1014.49024OpenAlexW2094930482MaRDI QIDQ4806389
Publication date: 14 May 2003
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-03-01491-1
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (7)
New hybrid conjugate gradient method as a convex combination of LS and FR methods ⋮ A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization ⋮ On probabilities in biology and physics ⋮ A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization ⋮ An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems ⋮ Convergence of the descent Dai–Yuan conjugate gradient method for unconstrained optimization ⋮ A new family of conjugate gradient methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of globally convergent conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Efficient hybrid conjugate gradient techniques
- A three-parameter family of nonlinear conjugate gradient methods
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Restart procedures for the conjugate gradient method
- 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
- Function minimization by conjugate gradients
- The Convergence of a Class of Double-rank Minimization Algorithms
- Methods of conjugate gradients for solving linear systems
- New properties of a nonlinear conjugate gradient method
- An efficient hybrid conjugate gradient method for unconstrained optimization
This page was built for publication: A family of hybrid conjugate gradient methods for unconstrained optimization