Search Results for ""

A topology tau on a topological vector space X=(X,tau) (with X usually assumed to be T2) is said to be locally convex if tau admits a local base at 0 consisting of balanced, ...

A set S in a vector space over R is called a convex set if the line segment joining any pair of points of S lies entirely in S.

A row-convex polyomino is a self-avoiding convex polyomino such that the intersection of any horizontal line with the polyomino has at most two connected components. A ...

A subset S subset R^n is said to be pseudo-convex at a point x in S if the associated pseudo-tangent cone P_S(x) to S at x contains S-{x}, i.e., if S-{x} subset P_S(x). Any ...

A subset A of a vector space V is said to be convex if lambdax+(1-lambda)y for all vectors x,y in A, and all scalars lambda in [0,1]. Via induction, this can be seen to be ...

A real-valued function g defined on a convex subset C subset R^n is said to be quasi-convex if for all real alpha in R, the set {x in C:g(x)<alpha} is convex. This is ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A convex function is a continuous function whose value at the midpoint of every interval in its domain does not exceed the arithmetic mean of its values at the ends of the ...

A column-convex polyomino is a self-avoiding convex polyomino such that the intersection of any vertical line with the polyomino has at most two connected components. ...

A normed vector space X=(X,||·||_X) is said to be uniformly convex if for sequences {x_n}={x_n}_(n=1)^infty, {y_n}={y_n}_(n=1)^infty, the assumptions ||x_n||_X<=1, ...