Hybrid broyden method for unconstrained optimization
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
In this article we consider a hybrid search direction of Broyden method and steepest descent method. In particular, we try to analyze the performance and discuss thoroughly on the convergence of this hybrid method. We also provide some numerical results to show that the algorithm is comparable to the Broyden algorithm.
Açıklama
Anahtar Kelimeler
Broyden method, Superlinearly convergent, Hybrid search direction, Hessian approximation
Kaynak
International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Mamat, M., Mohd, I. ve June, L. W. (2009). Hybrid broyden method for unconstrained optimization. Maltepe Üniversitesi. s. 289.
