Two modified conjugate gradient methods for unconstrained optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Algorithm 851
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- An unconstrained optimization test functions collection
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- Benchmarking optimization software with performance profiles.
- CUTE
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Methods of conjugate gradients for solving linear systems
- Some modified conjugate gradient methods for unconstrained optimization
- The conjugate gradient method in extremal problems
This page was built for publication: Two modified conjugate gradient methods for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971049)
