geometry, a set of points is convex if it contains every line segment between two points in the set. For example, a solid cube is a convex set, but anything...
27 KB (3,429 words) - 17:52, 10 May 2025
disk. The disked hull or the absolute convex hull of a set is the intersection of all disks containing that set. A subset S {\displaystyle S} of a real...
11 KB (1,913 words) - 09:38, 28 August 2024
convex sets of geometry, one uses order-convex instead of "convex". A convex sublattice of a lattice L is a sublattice of L that is also a convex set...
40 KB (5,351 words) - 15:10, 28 June 2025
In geometry, the convex hull, convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined...
58 KB (7,173 words) - 01:04, 1 July 2025
function is convex if its epigraph (the set of points on or above the graph of the function) is a convex set. In simple terms, a convex function graph...
35 KB (5,857 words) - 19:23, 1 August 2025
whose topology is generated by translations of balanced, absorbent, convex sets. Alternatively they can be defined as a vector space with a family of...
58 KB (10,541 words) - 04:52, 2 July 2025
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n {\displaystyle n} -dimensional...
23 KB (3,266 words) - 16:42, 30 July 2025
combinations with positive coefficients. It follows that convex cones are convex sets. The definition of a convex cone makes sense in a vector space over any ordered...
28 KB (3,941 words) - 12:49, 8 May 2025
Convex analysis is the branch of mathematics devoted to the study of properties of convex functions and convex sets, often with applications in convex...
16 KB (2,605 words) - 20:34, 8 June 2025
Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently...
30 KB (3,170 words) - 11:17, 22 June 2025
In geometry, a convex polygon is a polygon that is the boundary of a convex set. This means that the line segment between two points of the polygon is...
6 KB (881 words) - 09:02, 13 March 2025
Star domain (redirect from Star convex set)
a set S {\displaystyle S} in the Euclidean space R n {\displaystyle \mathbb {R} ^{n}} is called a star domain (or star-convex set, star-shaped set or...
7 KB (1,064 words) - 11:28, 24 June 2025
Function of several complex variables (redirect from Logarithmically convex set)
logarithmically-convex. A Reinhardt domain D is called logarithmically convex if the image λ ( D ∗ ) {\displaystyle \lambda (D^{*})} of the set D ∗ = { z =...
124 KB (17,717 words) - 22:01, 1 July 2025
In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space. Convex sets occur naturally in many areas: computational...
7 KB (685 words) - 05:24, 24 June 2025
problems in mathematical programming can be formulated as problems on convex sets or convex bodies. Six kinds of problems are particularly important:: Sec.2 ...
26 KB (3,992 words) - 02:16, 27 May 2025
Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves...
37 KB (4,174 words) - 06:39, 27 September 2024
In geometry, a set K ⊂ Rd is defined to be orthogonally convex if, for every line L that is parallel to one of standard basis vectors, the intersection...
13 KB (1,508 words) - 09:50, 5 March 2025
example, every convex combination of two points lies on the line segment between the points. A set is convex if it contains all convex combinations of...
7 KB (542 words) - 18:16, 1 January 2025
function p : X → R {\displaystyle p:X\to \mathbb {R} } which is subadditive, convex, and satisfies p ( 0 ) ≤ 0 {\displaystyle p(0)\leq 0} is also positively...
22 KB (4,192 words) - 17:21, 18 April 2025
Interval (mathematics) (category Sets of real numbers)
Theorem 2.3.23 The concepts of convex sets and convex components are used in a proof that every totally ordered set endowed with the order topology is...
34 KB (4,806 words) - 01:36, 4 August 2025
used to solve non-differentiable convex optimization problems. Many interesting problems can be formulated as convex optimization problems of the form...
5 KB (589 words) - 12:28, 21 June 2025
set – Convex and balanced set Balanced set – Construct in functional analysis Bornivorous set – A set that can absorb any bounded subset Bounded set (topological...
40 KB (7,720 words) - 21:39, 22 May 2024
convex cones, and convex sets are generalizations of vector subspaces: a vector subspace is also an affine subspace, a convex cone, and a convex set,...
18 KB (2,665 words) - 23:41, 5 August 2025
convex sets (POCS), sometimes known as the alternating projection method, is a method to find a point in the intersection of two closed convex sets....
7 KB (1,118 words) - 12:00, 29 December 2023
joins points Convex polygon, a polygon which encloses a convex set of points Convex polytope, a polytope with a convex set of points Convex metric space...
1 KB (208 words) - 03:46, 27 February 2023
Quasiconvex function (redirect from Quasi-convex function)
a convex subset of a real vector space such that the inverse image of any set of the form ( − ∞ , a ) {\displaystyle (-\infty ,a)} is a convex set. For...
12 KB (1,436 words) - 21:33, 2 August 2025
double lattice packing density of any convex set, and more generally for the optimal packing density of any convex set. The 1000 Kwacha coin of Zambia is...
15 KB (1,714 words) - 16:57, 24 June 2025
Extreme point (redirect from Extreme subset of convex set)
In mathematics, an extreme point of a convex set S {\displaystyle S} in a real or complex vector space is a point in S {\displaystyle S} that does not...
12 KB (2,055 words) - 17:20, 17 July 2025
hull of a convex set may fail to be convex (however, the convex hull of a balanced set is always balanced). For an example, let the convex subset be S...
27 KB (5,279 words) - 16:57, 21 March 2024
convex function and G is a convex set. Without loss of generality, we can assume that the objective f is a linear function. Usually, the convex set G...
30 KB (4,691 words) - 00:20, 20 June 2025