A Minimization Algorithm for Limit Extremal Problems on Convex Compactum

Deger O.

3rd International Conference of Mathematical Sciences (ICMS), İstanbul, Türkiye, 4 - 08 Eylül 2019, cilt.2183 identifier identifier

  • Yayın Türü: Bildiri / Tam Metin Bildiri
  • Cilt numarası: 2183
  • Doi Numarası: 10.1063/1.5136129
  • Basıldığı Şehir: İstanbul
  • Basıldığı Ülke: Türkiye
  • İstanbul Üniversitesi Adresli: Evet

Özet

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].