Hybrid broyden method for unconstrained optimization

Basit Öğe Kaydı
dc.contributor.authorMamat, Mustafa
dc.contributor.authorMohd, Ismail
dc.contributor.authorJune, Leong Wah
dc.date.accessioned2024-07-12T20:51:52Z
dc.date.available2024-07-12T20:51:52Z
dc.date.issued2009en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractIn 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.en_US
dc.identifier.citationMamat, M., Mohd, I. ve June, L. W. (2009). Hybrid broyden method for unconstrained optimization. Maltepe Üniversitesi. s. 289.en_US
dc.identifier.endpage290en_US
dc.identifier.isbn9.78605E+12
dc.identifier.startpage289en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2490
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.publicationcategoryUluslararası Konferans Öğesi - Başka Kurum Yazarıen_US
dc.rightsCC0 1.0 Universal*
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rights.urihttp://creativecommons.org/publicdomain/zero/1.0/*
dc.snmzKY07855
dc.subjectBroyden methoden_US
dc.subjectSuperlinearly convergenten_US
dc.subjectHybrid search directionen_US
dc.subjectHessian approximationen_US
dc.titleHybrid broyden method for unconstrained optimizationen_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu