Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
From MaRDI portal
Publication:5277965
DOI10.1080/02331934.2017.1295242zbMath1375.90281OpenAlexW2590698792MaRDI QIDQ5277965
Deren Han, Xiao Liang Dong, Reza Ghanbari, Xiang-Li Li, Zhi-feng Dai
Publication date: 12 July 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1295242
global convergencethree-term conjugate gradient methodaffine combinationsufficient descent conditionquasi-Newton condition
Related Items (12)
An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition ⋮ Delay dynamic double integral inequalities on time scales with applications ⋮ A hybrid conjugate gradient based approach for solving unconstrained optimization and motion control problems ⋮ A derivative-free three-term Hestenes–Stiefel type method for constrained nonlinear equations and image restoration ⋮ An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method ⋮ Solving Unconstrained Optimization Problems with Some Three-term Conjugate Gradient Methods ⋮ A hybrid HS-LS conjugate gradient algorithm for unconstrained optimization with applications in motion control and image recovery ⋮ A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem ⋮ An efficient adaptive three-term extension of the Hestenes–Stiefel conjugate gradient method ⋮ Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search ⋮ An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation ⋮ Least-squares-based three-term conjugate gradient methods
Cites Work
- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- An optimal parameter for Dai-Liao family of conjugate gradient methods
- A Barzilai-Borwein conjugate gradient method
- An improved nonlinear conjugate gradient method with an optimal property
- Some nonlinear conjugate gradient methods with sufficient descent condition and global convergence
- On optimality of two adaptive choices for the parameter of Dai-Liao method
- Two new conjugate gradient methods based on modified secant equations
- Constructing parametric quadratic curves
- An active set modified Polak-Ribiére-Polyak method for large-scale nonlinear bound constrained optimization
- A class of modified FR conjugate gradient method and applications to non-negative matrix factorization
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Optimization theory and methods. Nonlinear programming
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A modified Hestenes-Stiefel conjugate gradient method with sufficient descent condition and conjugacy condition
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- A Modified Nonmonotone Hestenes–Stiefel Type Conjugate Gradient Methods for Large-Scale Unconstrained Problems
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- CUTE
- 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
- Function minimization by conjugate gradients
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Some descent three-term conjugate gradient methods and their global convergence
- Convergence Conditions for Ascent Methods
- A descent family of Dai–Liao conjugate gradient methods
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Benchmarking optimization software with performance profiles.
- A new efficient conjugate gradient method for unconstrained optimization
This page was built for publication: Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination
