where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...
Our news journalists obtained a quote from the research from Brussels Free University, "The present paper provides discrete convex extrema for several situations of this type. The starting point is ...
Abstract: Let A be a compact subset of a (real) Hilbert space H. Denote by co(A) the convex hull of A. We will discuss the following problem: How much larger is co(A) than A? We present several bounds ...
SIAM Journal on Applied Mathematics, Vol. 27, No. 1 (Jul., 1974), pp. 131-137 (7 pages) A necessary condition and a sufficient condition for the pseudo-convexity of a function are given. These ...
At the International Workshop on Combinatorial Image Analysis, held in Brno, Czech Republic, our URGE To Compute team received the Best Student Paper Award for their presentation, "On Intersection ...
In this paper, the componentwise increasing convex order, the upper orthant order, the upper orthant convex order, and the increasing directionally convex order for random vectors are generalized to ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback