Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy
From MaRDI portal
Publication:6495538
DOI10.1080/0305215X.2022.2150761MaRDI QIDQ6495538
Alireza Hosseini Dehmiry, Unnamed Author
Publication date: 30 April 2024
Published in: Engineering Optimization (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A short note on the global convergence of the unmodified PRP method
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- An improved nonlinear conjugate gradient method with an optimal property
- Dai-Kou type conjugate gradient methods with a line search only using gradient
- The convergence properties of some new conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
- Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
- Conjugate gradient methods with Armijo-type line searches.
- 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
- Nonlinear conjugate gradient methods for unconstrained optimization
- The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
- Modified three-term Liu-Storey conjugate gradient method for solving unconstrained optimization problems and image restoration problems
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Some three-term conjugate gradient methods with the new direction structure
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- The global convergence of a modified BFGS method for nonconvex functions
- 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
- Convergence Properties of Algorithms for Nonlinear Optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Convergence Properties of the BFGS Algoritm
- Convergence properties of the Fletcher-Reeves method
- 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
- Function minimization by conjugate gradients
- Some descent three-term conjugate gradient methods and their global convergence
- The conjugate gradient method in extremal problems
- On the convergence properties of the unmodified PRP method with a non-descent line search
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: Global convergence of three-term conjugate gradient methods on general functions under a new inexact line search strategy