An efficient adaptive scaling parameter for the spectral conjugate gradient method
From MaRDI portal
Publication:5963695
DOI10.1007/S11590-015-0865-8zbMATH Open1335.65056OpenAlexW2067092768MaRDI QIDQ5963695FDOQ5963695
Publication date: 23 February 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0865-8
global convergenceunconstrained optimizationnumerical experimentsnumerical stabilitydescent propertyspectral conjugate gradient methodscaling parameter
Cites Work
- Algorithm 851
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Scaled conjugate gradient algorithms for unconstrained optimization
- Technical Note—A Modified Conjugate Gradient Algorithm
- Title not available (Why is that?)
- Restart procedures for the conjugate gradient method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- A descent family of Dai–Liao conjugate gradient methods
Cited In (3)
Uses Software
This page was built for publication: An efficient adaptive scaling parameter for the spectral conjugate gradient method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963695)
