- Tytuł:
- Approximation of set-valued functions by single-valued one
- Autorzy:
-
Ginchev, Ivan
Hoffmann, Armin - Powiązania:
- https://bibliotekanauki.pl/articles/729538.pdf
- Data publikacji:
- 2002
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
Chebyshev approximation
set-valued functions
convex optimization - Opis:
- Let $Σ: M → 2^Y\{∅}$ be a set-valued function defined on a Hausdorff compact topological space M and taking values in the normed space (Y,||·||). We deal with the problem of finding the best Chebyshev type approximation of the set-valued function Σ by a single-valued function g from a given closed convex set V ⊂ C(M,Y). In an abstract setting this problem is posed as the extremal problem $sup_{t ∈ M} ρ(g(t), (t)) → inf$, g ∈ V. Here ρ is a functional whose values ρ(q,S) can be interpreted as some distance from the point q to the set S ⊂ Y. In the paper, we are confined to two natural distance functionals ρ = H and ρ = D. H(q,S) is the Hausdorff distance (the excess) from the point q to the set cl S, and D(q,S) is referred to as the oriented distance from the point q to set cl conv S. We prove that both these problems are convex optimization problems. While distinguishing between the so called regular and irregular case problems, in particular the case V = C(M,Y) is studied to show that the solutions in the irregular case are obtained as continuous selections of certain set-valued maps. In the general case, optimality conditions in terms of directional derivatives are obtained of both primal and dual type.
- Źródło:
-
Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2002, 22, 1; 33-66
1509-9407 - Pojawia się w:
- Discussiones Mathematicae, Differential Inclusions, Control and Optimization
- Dostawca treści:
- Biblioteka Nauki
Artykuł