Two spectral conjugate gradient methods for unconstrained optimization problems
From MaRDI portal
Publication:2103183
DOI10.1007/S12190-022-01730-1OpenAlexW4223464318MaRDI QIDQ2103183FDOQ2103183
Tian Wang, Zhibin Zhu, Ai Long
Publication date: 13 December 2022
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-022-01730-1
global convergencespectral conjugate gradient methodunconstrained optimization problemstandard Wolfe line search
Cites Work
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Function minimization by conjugate gradients
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- An unconstrained optimization test functions collection
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Efficient generalized conjugate gradient algorithms. I: Theory
- Title not available (Why is that?)
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- A three-parameter family of nonlinear conjugate gradient methods
- A spectral conjugate gradient method for unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- Title not available (Why is that?)
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- Spectral conjugate gradient methods for vector optimization problems
- Title not available (Why is that?)
- 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)
