0] [member of] B(H) and K is a weakly compact convex subset
of the predual B[(H).
X, where X is an open convex subset
of Rn (n-dimensional Euclidean space), (Eq.
Let E be a normal topological vector space and U an open convex subset
of E with 0 [member of] U.
Let K be a nonempty closed convex subset
of E and [2.
In fact, in a convex subset
there is a minimal shortest path connecting any pair of points.
Computing the largest empty convex subset
of a set of points.
xi]]L([xi]) is a non-empty compact convex subset
2] norm of the difference of discrete functions and their discrete mean value on the boundary of a convex subset
, but rather an easier bound on the [L.
n] : X(x) [greater than or equal to] [alpha]} is a nonempty compact convex subset
Sastry and Babu  proved that any fixed point of a Lipschitzian pseudocontractive self mapping of a non-empty closed convex subset
K of a Banach space X is unique and may be norm approximated by Mann iterative procedure (1.
The image of the energy-Casimir map is a convex subset
n] :X(x) [greater than or equal to] [alpha]} is a non empty compact convex subset