Two classes of spectral conjugate gradient methods for unconstrained optimizations
DOI10.1007/S12190-022-01713-2zbMATH Open1499.65218OpenAlexW4212885595MaRDI QIDQ2103158FDOQ2103158
Pengjie Liu, Chen Zhang, Jinbao Jian, Xianzhen Jiang
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-01713-2
global convergenceunconstrained optimizationstrong Wolfe line searchspectral conjugate gradient method
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Testing Unconstrained Optimization Software
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
- Function minimization by conjugate gradients
- 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
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Some descent three-term conjugate gradient methods and their global convergence
- Methods of conjugate gradients for solving linear systems
- Global convergence result for conjugate gradient methods
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- A spectral conjugate gradient method for unconstrained optimization
- Hybrid conjugate gradient algorithm for unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- New hybrid conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- Two modified three-term conjugate gradient methods with sufficient descent property
- Two modified DY conjugate gradient methods for unconstrained optimization problems
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- Least-squares-based three-term conjugate gradient methods
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
Cited In (4)
Uses Software
This page was built for publication: Two classes of spectral conjugate gradient methods for unconstrained optimizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103158)
