A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter
From MaRDI portal
Publication:2868907
DOI10.1080/02331934.2011.611512zbMath1278.65085OpenAlexW1997134377MaRDI QIDQ2868907
Publication date: 19 December 2013
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2011.611512
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization, Comments on “A hybrid conjugate gradient method based on a quadratic relaxation of the Dai-Yuan hybrid conjugate gradient parameter”
Uses Software
Cites Work
- Unnamed Item
- On restart procedures for the conjugate gradient method
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- Multi-step nonlinear conjugate gradient methods for unconstrained minimization
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- Two new conjugate gradient methods based on modified secant equations
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Efficient hybrid conjugate gradient techniques
- Global convergence result for conjugate gradient methods
- Global convergence properties of nonlinear conjugate gradient methods with modified secant condition
- Another hybrid conjugate gradient algorithm for unconstrained optimization
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- A note on global convergence result for conjugate gradient methods
- A Modified BFGS Algorithm for Unconstrained Optimization
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Restart procedures for the conjugate gradient method
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- CUTEr and SifDec
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- A modified BFGS method and its global convergence in nonconvex minimization
- A spectral conjugate gradient method for unconstrained optimization
- New properties of a nonlinear conjugate gradient method
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
