Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
From MaRDI portal
Publication:1757395
DOI10.1016/j.cam.2018.09.012zbMath1409.90092OpenAlexW2891953303WikidataQ129222703 ScholiaQ129222703MaRDI QIDQ1757395
Publication date: 4 January 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2018.09.012
Related Items (18)
An online conjugate gradient algorithm for large-scale data analysis in machine learning ⋮ An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization ⋮ A new smoothing spectral conjugate gradient method for solving tensor complementarity problems ⋮ Two new conjugate gradient methods for unconstrained optimization ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ An efficient conjugate gradient method with strong convergence properties for non-smooth optimization ⋮ Unnamed Item ⋮ An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction ⋮ A spectral three-term Hestenes-Stiefel conjugate gradient method ⋮ Two modified DY conjugate gradient methods for unconstrained optimization problems ⋮ An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation ⋮ A new conjugate gradient method with an efficient memory structure ⋮ Two improved nonlinear conjugate gradient methods with the strong Wolfe line search ⋮ A nonmonotone scaled Fletcher-Reeves conjugate gradient method with application in image reconstruction ⋮ Two classes of spectral conjugate gradient methods for unconstrained optimizations ⋮ Two modified conjugate gradient methods for unconstrained optimization with applications in image restoration problems ⋮ Two spectral conjugate gradient methods for unconstrained optimization problems ⋮ An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- Hybrid conjugate gradient algorithm for unconstrained optimization
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- Two modified nonlinear conjugate gradient methods with disturbance factors for unconstrained optimization
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- Algorithm 851
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
- 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
- Function minimization by conjugate gradients
- CUTEr and SifDec
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
- An efficient hybrid conjugate gradient method for unconstrained optimization
- A new efficient conjugate gradient method for unconstrained optimization
This page was built for publication: Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
