No label defined (Q4243475)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1288348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1288348 |
Statements
18 May 1999
0 references
set-valued functions
0 references
differentiability
0 references
convex set-valued functions
0 references
cancellation law
0 references
Hausdorff metric
0 references
embedding theorem
0 references
0.8020175099372864
0 references
0.7905024886131287
0 references
The purpose of this paper is to give some necessary and sufficient conditions under which a differentiable set-valued function is convex. Let \(L\) be a normed linear space and let \(C\) be a convex and open subset of \(L\). Theorem. Suppose that \(f:C\to R\) is convex on \(C\) and differentiable at \(x_0\) (i.e., \(f\) has a Fréchet derivative at \(x_0\)). Then for \(x\in C\) \[ f(x)-f(x_0)\geq f'(x_0)(x-x_0). \tag{1} \] If \(f\) is differentiable troughout \(C\), then \(f\) is convex if and only if (1) holds for all \(x,x_0\in C\). First, the above theorem is extended to convex functions \(f:C\to M\), where \(M\) is an ordered normed space. Further, the author transfers the above theorem to convex set-valued functions with suitably adapted definition of differentiability.
0 references