convex domain
Смотреть что такое "convex domain" в других словарях:
Convex function — on an interval. A function (in black) is convex if and only i … Wikipedia
Convex optimization — Convex minimization, a subfield of optimization, studies the problem of minimizing convex functions over convex sets. Given a real vector space X together with a convex, real valued function defined on a convex subset of X, the problem is to find … Wikipedia
Convex set — A convex set … Wikipedia
Domain of holomorphy — The sets in the definition. In mathematics, in the theory of functions of several complex variables, a domain of holomorphy is a set which is maximal in the sense that there exists a holomorphic function on this set which cannot be extended to a… … Wikipedia
Convex conjugate — In mathematics, convex conjugation is a generalization of the Legendre transformation. It is also known as Legendre–Fenchel transformation or Fenchel transformation (after Adrien Marie Legendre and Werner Fenchel). Contents 1 Definition 2… … Wikipedia
Star domain — In mathematics, a set S in the Euclidean space R n is called a star domain (or star convex set) if there exists x 0 in S such that for all x in S the line segment from x 0 to x is in S. This definition is immediately generalizable to any real or… … Wikipedia
Holomorphically convex hull — In mathematics, more precisely in complex analysis, the holomorphically convex hull of a given compact set in the n dimensional complex space C n is defined as follows. Let G subset {mathbb{C^n be a domain (an open and connected set), or… … Wikipedia
Proper convex function — In mathematics, a proper convex function is a convex function f taking values in the extended real number line such that:f(x) < +inftyfor at least one x and :f(x) > inftyfor every x . This definition takes account of the fact that the extended… … Wikipedia
Locally convex topological vector space — In functional analysis and related areas of mathematics, locally convex topological vector spaces or locally convex spaces are examples of topological vector spaces (TVS) which generalize normed spaces. They can be defined as topological vector… … Wikipedia
Jump-and-Walk algorithm — Jump and Walk is an algorithm for point location in triangulations (though most of the theoretical analysis were performed in 2D and 3D random Delaunay triangulations). Surprisingly, the algorithm does not need any preprocessing or complex data… … Wikipedia
Local consistency — In constraint satisfaction, local consistency conditions are properties of constraint satisfaction problems related to the consistency of subsets of variables or constraints. Several such conditions exist, the most known being node consistency,… … Wikipedia
