Spectral three-term constrained conjugate gradient algorithm for function minimizations
From MaRDI portal
Publication:2294136
DOI10.1155/2019/6378368zbMath1442.65100OpenAlexW2997811160WikidataQ126463808 ScholiaQ126463808MaRDI QIDQ2294136
Rana Z. Al-Kawaz, Abbas Y. Al-Bayati, Huda I. Ahmed
Publication date: 10 February 2020
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/6378368
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- A descent Dai-Liao conjugate gradient method based on a modified secant equation and its global convergence
- New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A Dai-Liao conjugate gradient method via modified secant equation for system of nonlinear equations
- The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices
- A modified Polak–Ribière–Polyak conjugate gradient algorithm for unconstrained optimization
- An extended Dai-Liao conjugate gradient method with global convergence for nonconvex functions
- An adaptive Hager-Zhang conjugate gradient method
- Function minimization by conjugate gradients
- Nonlinear Programming
- Convergence Conditions for Ascent Methods. II: Some Corrections
- 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
- Benchmarking optimization software with performance profiles.
This page was built for publication: Spectral three-term constrained conjugate gradient algorithm for function minimizations
