Search Results for ""

A function f(x) is logarithmically convex on the interval [a,b] if f>0 and lnf(x) is convex on [a,b]. If f(x) and g(x) are logarithmically convex on the interval [a,b], then ...

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 ...

The (signed) area of a planar non-self-intersecting polygon with vertices (x_1,y_1), ..., (x_n,y_n) is A=1/2(|x_1 x_2; y_1 y_2|+|x_2 x_3; y_2 y_3|+...+|x_n x_1; y_n y_1|), ...

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 ...

A polygon whose vertices do not all lie in a plane.

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 ...