Modification of nonlinear conjugate gradient method with weak Wolfe-Powell line search
From MaRDI portal
Publication:1667567
DOI10.1155/2017/7238134zbMath1470.90158OpenAlexW2592471513WikidataQ59142387 ScholiaQ59142387MaRDI QIDQ1667567
Zabidin Salleh, Ahmad Alhawarat
Publication date: 30 August 2018
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/7238134
Related Items
A new modified three-term conjugate gradient method with sufficient descent property and its global convergence, A new modified three-term Hestenes-Stiefel conjugate gradient method with sufficient descent property and its global convergence, An efficient modified AZPRP conjugate gradient method for large-scale unconstrained optimization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The convergence properties of some new conjugate gradient methods
- Efficient generalized conjugate gradient algorithms. I: Theory
- A note about WYL's conjugate gradient method and its applications
- An improved Wei-Yao-Liu nonlinear conjugate gradient method for optimization computation
- Conjugate gradient methods with Armijo-type line searches.
- A modified Wei-Yao-Liu conjugate gradient method for unconstrained optimization
- An efficient hybrid conjugate gradient method with the strong Wolfe-Powell line search
- Global convergence of the Fletcher-Reeves algorithm with inexact linesearch
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A three-parameter family of nonlinear conjugate gradient methods
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- CUTE
- An efficient modified Polak–Ribière–Polyak conjugate gradient method with global convergence properties
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Function minimization by conjugate gradients
- The Limited Memory Conjugate Gradient Method
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
