Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||A spectral conjugate gradient method for unconstrained optimization|
|Abstract:||A family of scaled conjugate gradient algorithms for large-scale unconstrained minimization is defined. The Ferry, the Polak-Ribiere and the Fletcher-Reeves formulae are compared using a spectral scaling derived from Raydan's spectral gradient optimization method. The best combination of formula, scaling and initial choice of step-length is compared against well known algorithms using a classical set of problems. An additional comparison involving an ill-conditioned estimation problem in Optics is presented.|
spectral gradient method
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.