A new Liu-Storey type nonlinear conjugate gradient method for unconstrained optimization problems
From MaRDI portal
Publication:1004008
DOI10.1016/j.cam.2008.07.016zbMath1185.65101OpenAlexW1991750265MaRDI QIDQ1004008
Publication date: 2 March 2009
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.2008.07.016
Related Items
\(n\)-step quadratic convergence of a restart Liu-Storey type method, A hybrid conjugate gradient algorithm for nonconvex functions and its applications in image restoration problems, Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems, A derivative-free Liu-Storey method for solving large-scale nonlinear systems of equations, A sufficient descent LS conjugate gradient method for unconstrained optimization problems, A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems, Some sufficient descent conjugate gradient methods and their global convergence, A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convergence properties of some new conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- A globally convergent version of the Polak-Ribière conjugate gradient method
- 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
- Updating Quasi-Newton Matrices with Limited Storage
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Conjugate Gradient Methods with Inexact Searches
- CUTE
- Line search algorithms with guaranteed sufficient decrease
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- Some descent three-term conjugate gradient methods and their global convergence
- Convergence Conditions for Ascent Methods
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Benchmarking optimization software with performance profiles.
