Global convergence of conjugate gradient method in unconstrained optimization problems

Basit Öğe Kaydı
dc.contributor.authorNajm, Huda Y.
dc.contributor.authorHamed, Eman T.
dc.contributor.authorAhmed, Huda I.
dc.date.accessioned2024-07-12T20:54:22Z
dc.date.available2024-07-12T20:54:22Z
dc.date.issued2019en_US
dc.departmentMaltepe Üniversitesi, İnsan ve Toplum Bilimleri Fakültesien_US
dc.description.abstractIn this study, we propose a new parameter in conjugate gradient method. It is shown that the new method fulfills the sufficient descent condition with the strong Wolfe condition when inexact line search has been used. The numerical results of this suggested method also shown that this method outperforms to other standard conjugate gradient method.en_US
dc.identifier.citationNajm, H. Y., Hamed, E. T., Ahmed, H. I. (2019). Global convergence of conjugate gradient method in unconstrained optimization problems. International Conference of Mathematical Sciences. s. 030029(1)-030029(4).en_US
dc.identifier.endpage030029-4en_US
dc.identifier.isbn978-0-7354-1816-5
dc.identifier.startpage030029-1en_US
dc.identifier.urihttps://aip.scitation.org/doi/10.1063/1.5095114
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2751
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciencesen_US
dc.relation.isversionof10.1063/1.5095114en_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.snmzKY01329
dc.subjectUnconstrained optimizationen_US
dc.subjectConjugate gradient methoden_US
dc.subjectInexact line searchen_US
dc.subjectGlobal convergenceen_US
dc.titleGlobal convergence of conjugate gradient method in unconstrained optimization problemsen_US
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu