Değeri Özkan2024-07-122024-07-122019Değer, Ö. (2019). A minimization algorithm for limit extremal problems on convex compactum. International Conference of Mathematical Sciences (ICMS 2019). s. 53.978-605-2124-29-1https://hdl.handle.net/20.500.12415/2165In 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.enCC0 1.0 Universalinfo:eu-repo/semantics/openAccessLimit extremal problemsConvex optimizationArticle5353