Two spectral conjugate gradient methods for unconstrained optimization problems
From MaRDI portal
Publication:2103183
DOI10.1007/s12190-022-01730-1OpenAlexW4223464318MaRDI QIDQ2103183
Tian Wang, Ai Long, Zhi Bin Zhu
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
- Efficient generalized conjugate gradient algorithms. I: Theory
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- An efficient DY-type spectral conjugate gradient method for system of nonlinear monotone equations with application in signal recovery
- A modified nonlinear Polak-Ribière-Polyak conjugate gradient method with sufficient descent property
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A three-parameter family of nonlinear conjugate gradient methods
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Function minimization by conjugate gradients
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Two spectral conjugate gradient methods for unconstrained optimization problems
