3. Convexity in vector spaces
Definition (convex subset). Let (E, +, ×) be a real vector space. A non-empty subsetX of E is convex if it contains all closed line segments joining each pair of points belonging to it, or in other words (p. 4 of
, p. 1 and p. 215 of
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!
Ongoing reading
Convexity in vector spaces
Bibliography
-
(1) - ANDERSON (R.D.), KLEE (V.) -
Convex functions and upper-semicontinuous collections,
-
Duke Mathematical Journal, Vol. 19, pp. 349-357 (1952).
-
(2) - ASPLUND (E.) -
Čebyšev sets in Hilbert space,
-...
You do not have access to this resource.
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed?
Log in!