A modified hybrid conjugate gradient method for unconstrained optimization
From MaRDI portal
Publication:2034936
DOI10.1155/2021/5597863zbMath1477.90102OpenAlexW3131790919MaRDI QIDQ2034936
Publication date: 23 June 2021
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2021/5597863
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- The convergence properties of some new conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- A note about WYL's conjugate gradient method and its applications
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- The proof of the sufficient descent condition of the Wei-Yao-Liu conjugate gradient method under the strong Wolfe-Powell line search
- Testing Unconstrained Optimization Software
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- Function minimization by conjugate gradients
- 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: A modified hybrid conjugate gradient method for unconstrained optimization