A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
From MaRDI portal
Publication:2421741
DOI10.1155/2017/2715854zbMath1461.90166OpenAlexW2754896482MaRDI QIDQ2421741
Bakhtawar Baluch, Ahmad Alhawarat, U. A. M. Roslan, Zabidin Salleh
Publication date: 18 June 2019
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/2715854
Related Items
A new smoothing modified three-term conjugate gradient method for \(l_1\)-norm minimization problem ⋮ A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization ⋮ A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence ⋮ A survey of gradient methods for solving nonlinear optimization ⋮ New hybrid conjugate gradient and Broyden-Fletcher-Goldfarb-Shanno conjugate gradient methods
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On three-term conjugate gradient algorithms for unconstrained optimization
- A simple three-term conjugate gradient algorithm for unconstrained optimization
- An efficient modification of the Hestenes-Stiefel nonlinear conjugate gradient method with restart property
- Another improved Wei-Yao-Liu nonlinear conjugate gradient method with sufficient descent property
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- Two modified three-term conjugate gradient methods with sufficient descent property
- Global optimization through a stochastic perturbation of the Polak-Ribière conjugate gradient method
- Global convergence of some modified PRP nonlinear conjugate gradient methods
- New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems
- Efficient generalized conjugate gradient algorithms. I: Theory
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A conjugate direction algorithm without line searches
- Optimization. Algorithms and consistent approximations
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
- Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
- Three modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Testing Unconstrained Optimization Software
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Restart procedures for the conjugate gradient method
- An efficient modified Polak–Ribière–Polyak conjugate gradient method with global convergence properties
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- Some descent three-term conjugate gradient methods and their global convergence
- A Two-Term PRP-Based Descent Method
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
This page was built for publication: A new modified three-term conjugate gradient method with sufficient descent property and its global convergence
