A spectral three-term Hestenes-Stiefel conjugate gradient method
From MaRDI portal
Publication:2040607
DOI10.1007/s10288-020-00432-3zbMath1471.90138OpenAlexW3006975782MaRDI QIDQ2040607
Parvaneh Faramarzi, Keyvan Amini
Publication date: 14 July 2021
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-020-00432-3
unconstrained optimizationglobal convergencespectral parameterthree-term conjugate gradient methodmodified secant condition
Related Items (3)
A spectral conjugate gradient projection algorithm to solve the large-scale system of monotone nonlinear equations with application to compressed sensing ⋮ A globally convergent derivative-free projection method for nonlinear monotone equations with applications ⋮ Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- A conjugate direction algorithm without line searches
- A new conjugate gradient method based on quasi-Newton equation for unconstrained optimization
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- A modified spectral conjugate gradient method with global convergence
- An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A nonlinear conjugate gradient method based on the MBFGS secant condition
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Two-Point Step Size Gradient Methods
- Numerical Optimization
- CUTE
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- 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
- A modified Hestenes–Stiefel conjugate gradient method with an optimal property
- Some descent three-term conjugate gradient methods and their global convergence
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- A modified BFGS method and its global convergence in nonconvex minimization
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: A spectral three-term Hestenes-Stiefel conjugate gradient method
