A Minimization Algorithm for Limit Extremal Problems on Convex Compactum

dc.contributor.author	Deger, Ozkan
dc.date.accessioned	2021-03-05T16:48:29Z
dc.date.available	2021-03-05T16:48:29Z
dc.identifier.citation	Deger O., "A Minimization Algorithm for Limit Extremal Problems on Convex Compactum", 3rd International Conference of Mathematical Sciences (ICMS), İstanbul, Türkiye, 4 - 08 Eylül 2019, cilt.2183
dc.identifier.other	av_c26c6bb0-3d27-49c0-be3d-0d50c2bd2e8d
dc.identifier.other	vv_1032021
dc.identifier.uri	http://hdl.handle.net/20.500.12627/129030
dc.identifier.uri	https://doi.org/10.1063/1.5136129
dc.description.abstract	In an extremal problem, instead of f(x) one has a sequence f(n)(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. The algorithm is based on the linearization method of Pshenichnyi [1, 2].
dc.language.iso	eng
dc.subject	Fizik
dc.subject	Temel Bilimler
dc.subject	FİZİK, UYGULAMALI
dc.subject	Temel Bilimler (SCI)
dc.subject	Matematik
dc.title	A Minimization Algorithm for Limit Extremal Problems on Convex Compactum
dc.type	Bildiri
dc.contributor.department	İstanbul Üniversitesi , Fen Fakültesi , Matematik
dc.identifier.volume	2183
dc.contributor.firstauthorID	74798

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.