New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization
From MaRDI portal
Publication:2300007
DOI10.1155/2020/3615208zbMath1450.65056OpenAlexW3001353868MaRDI QIDQ2300007
Eman T. Hamed, Abbas Y. Al-Bayati, Rana Z. Al-Kawaz
Publication date: 24 February 2020
Published in: Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/3615208
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Iterative numerical methods for linear systems (65F10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization
- Global convergence of a two-parameter family of conjugate gradient methods without line search
- Efficient generalized conjugate gradient algorithms. I: Theory
- A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- A modified BFGS method and its global convergence in nonconvex minimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: New investigation for the Liu-Story scaled conjugate gradient method for nonlinear optimization