New spectral LS conjugate gradient method for nonlinear unconstrained optimization
From MaRDI portal
Publication:6106715
DOI10.1080/00207160.2022.2163165zbMath1513.65189OpenAlexW4313389385MaRDI QIDQ6106715
Publication date: 3 July 2023
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2022.2163165
unconstrained optimizationconjugacy conditionconvergent analysisnew spectral conjugate gradientsufficient descent inequality
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Methods of quasi-Newton type (90C53)
Cites Work
- Unnamed Item
- Unnamed Item
- Global convergence of a modified spectral conjugate gradient method
- New spectral PRP conjugate gradient method for unconstrained optimization
- Efficient generalized conjugate gradient algorithms. I: Theory
- A hybrid conjugate gradient method with descent property for unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- 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
This page was built for publication: New spectral LS conjugate gradient method for nonlinear unconstrained optimization