A minimization algorithm for limit extremal problems on convex compactum

Basit Öğe Kaydı
dc.authorid0000-0001-8487-4036en_US
dc.contributor.authorDeğeri Özkan
dc.date.accessioned2024-07-12T20:49:23Z
dc.date.available2024-07-12T20:49:23Z
dc.date.issued2019en_US
dc.departmentFakülteler, İnsan ve Toplum Bilimleri Fakültesi, Matematik Bölümüen_US
dc.description.abstractIn an extremal problem, instead of f(x) one has a sequence fn(x) of functions approximating in some sense f(x) and on the basis of which one has to find an extremum of f(x), such problems are usually called limit extremal problems. In this study, a minimization algorithm for limit extremal problems is proposed under some certain constraints. Let the set X ? R n be a nonempty convex compactum, i.e., X is closed, bounded and convex.en_US
dc.identifier.citationDeğer, Ö. (2019). A minimization algorithm for limit extremal problems on convex compactum. International Conference of Mathematical Sciences (ICMS 2019). s. 53.en_US
dc.identifier.endpage53en_US
dc.identifier.isbn978-605-2124-29-1
dc.identifier.startpage53en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12415/2165
dc.institutionauthorDeğeri Özkan
dc.language.isoenen_US
dc.publisherMaltepe Üniversitesien_US
dc.relation.ispartofInternational Conference of Mathematical Sciences (ICMS 2019)en_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.snmzKY01530
dc.subjectLimit extremal problemsen_US
dc.subjectConvex optimizationen_US
dc.titleA minimization algorithm for limit extremal problems on convex compactumen_US
dc.typeArticle
dspace.entity.typePublication

Dosyalar

Koleksiyon

İnsan ve Toplum Bilimleri Fakültesi Koleksiyonu