Search Results for ""

Graham's biggest little hexagon is the largest possible (not necessarily regular) convex hexagon with polygon diameter 1 (i.e., for which no two of the vertices are more than ...

Given a subset S subset R^n and a point x in S, the contingent cone K_S(x) at x with respect to S is defined to be the set K_S(x)={h:d_S^-(x;h)=0} where d_S^- is the upper ...

A set in Euclidean space R^d is convex set if it contains all the line segments connecting any pair of its points. If the set does not contain all the line segments, it is ...

In Season 4 episode "Black Swan" of the television crime drama NUMB3RS, the character Amita Ramanujan refers to graph entropies when studying a map of the Los Angeles while ...

Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...

A second-order partial differential equation of the form Hr+2Ks+Lt+M+N(rt-s^2)=0, (1) where H, K, L, M, and N are functions of x, y, z, p, and q, and r, s, t, p, and q are ...

Given a subset S subset R^n and a real function f which is Gâteaux differentiable at a point x in S, f is said to be pseudoconvex at x if del f(x)·(y-x)>=0,y in ...

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

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 conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...