Two spectral conjugate gradient methods for unconstrained optimization problems
From MaRDI portal
Publication:2103183
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 6179208 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- A spectral conjugate gradient method for unconstrained optimization
- A three-parameter family of nonlinear conjugate gradient methods
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- Methods of conjugate gradients for solving linear systems
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- The conjugate gradient method in extremal problems
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Two modified FR spectral conjugate gradient methods under Wolfe line search
Cited in
(7)- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- scientific article; zbMATH DE number 1546513 (Why is no real title available?)
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Spectral conjugate gradient methods for vector optimization problems
- scientific article; zbMATH DE number 7663620 (Why is no real title available?)
- An improved spectral conjugate gradient algorithm for nonconvex unconstrained optimization problems
- New spectral PRP conjugate gradient method for unconstrained optimization
This page was built for publication: Two spectral conjugate gradient methods for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103183)
