scientific article; zbMATH DE number 1288348
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.
- Convex set-valued functions on (0,) and their conjugate.
- scientific article; zbMATH DE number 3871704 (Why is no real title available?)
- scientific article; zbMATH DE number 4149009 (Why is no real title available?)
- Calculus rules on a new set—valued second order derivative for convex functions
- scientific article; zbMATH DE number 3897715 (Why is no real title available?)
- On non-differentiable convex functions
- scientific article; zbMATH DE number 798859 (Why is no real title available?)
- Sets of differentials and smoothness of convex functions
- An embedding result for a class of epigraphical sets and applications to set optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243475)
