A minimization algorithm for limit extremal problems on convex compactum
Küçük Resim Yok
Tarih
2019
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 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.
Açıklama
Anahtar Kelimeler
Limit extremal problems, Convex optimization
Kaynak
International Conference of Mathematical Sciences (ICMS 2019)
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Değer, Ö. (2019). A minimization algorithm for limit extremal problems on convex compactum. International Conference of Mathematical Sciences (ICMS 2019). s. 53.
