Linear combination of points where all coefficients are non-negative and sum to 1
In convex geometry and vector algebra, a convex combination is a linear combination of points (which can be vectors, scalars, or more generally points in an affine space) where all coefficients are non-negative and sum to 1.[1] In other words, the operation is equivalent to a standard weighted average, but whose weights are expressed as a percent of the total weight, instead of as a fraction of the count of the weights as in a standard weighted average.
More formally, given a finite number of points in a real vector space, a convex combination of these points is a point of the form
where the real numbers satisfy and [1]
As a particular example, every convex combination of two points lies on the line segment between the points.[1]
A set is convex if it contains all convex combinations of its points.
The convex hull of a given set of points is identical to the set of all their convex combinations.[1]
There exist subsets of a vector space that are not closed under linear combinations but are closed under convex combinations. For example, the interval is convex but generates the real-number line under linear combinations. Another example is the convex set of probability distributions, as linear combinations preserve neither nonnegativity nor affinity (i.e., having total integral one).
^ abcdRockafellar, R. Tyrrell (1970), Convex Analysis, Princeton Mathematical Series, vol. 28, Princeton University Press, Princeton, N.J., pp. 11–12, MR 0274683
and 26 Related for: Convex combination information
In convex geometry and vector algebra, a convexcombination is a linear combination of points (which can be vectors, scalars, or more generally points...
one can define the related concepts of affine combination, conical combination, and convexcombination, and the associated notions of sets closed under...
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...
property characterizes convex sets. Such an affine combination is called a convexcombination of u1, ..., ur. The collection of convex subsets of a vector...
for which the value at any convexcombination of elements in the domain is greater than or equal to the convexcombination of the values at the endpoints...
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...
expressed using coefficients that sum to one. Such a linear combination is called a convexcombination. Using the previous example, we would get the following...
non-empty convex compact set which does not contain the origin, then the convex conical hull of S is a closed set. Affine combinationConvexcombination Linear...
combinations of b→ with coefficients from the rows in A. Convexcombination Conical combination Linear combination Affine space Affine geometry Affine hull Gallier...
the convexcombination 0.5 x + 0.5 y = ( 4 , 4 ) {\displaystyle 0.5x+0.5y=(4,4)} is worse than both of them since its utility is 4. A set of convex-shaped...
analysis and related areas of mathematics, locally convex topological vector spaces (LCTVS) or locally convex spaces are examples of topological vector spaces...
_{1}P_{1}+\cdots +\theta _{k}P_{k}.} (Such a decomposition of X is known as a 'convexcombination'.) A proof of the theorem based on Hall's marriage theorem is given...
probability density function if it exists) can be expressed as a convexcombination (i.e. a weighted sum, with non-negative weights that sum to 1) of...
is a state that can not be written as a probabilistic mixture, or convexcombination, of other quantum states. There are several equivalent characterizations...
linear combinations with positive coefficients. It follows that convex cones are convex sets. In this article, only the case of scalars in an ordered field...
problems in mathematical programming can be formulated as problems on convex sets or convex bodies. Six kinds of problems are particularly important:: Sec.2 ...
can be defined as a set X {\displaystyle X} equipped with a binary convexcombination operation c λ : X × X → X {\displaystyle c_{\lambda }:X\times X\rightarrow...
Examples of convex curves include the convex polygons, the boundaries of convex sets, and the graphs of convex functions. Important subclasses of convex curves...
tight curves Combination – One edge of the blade is convexed, the opposite edge concaved, so the tool can be used on concaved and convexed surfaces. Spokeshaves...
\mathbb {Z} ^{n}} is integrally convex if any point y in the convex hull of X can be expressed as a convexcombination of the points of X that are "near"...
more precise by generalizing the notion of weighted average from a convexcombination to an integral taken over the set E of extreme points. Here C is a...
main idea of the proof is to rewrite the depolarizing channel as a convexcombination of simpler channels, and use properties of those simpler channels...
separable states are multipartite quantum states that can be written as a convexcombination of product states. Product states are multipartite quantum states...
Equivalently, a line segment is the convex hull of two points. Thus, the line segment can be expressed as a convexcombination of the segment's two end points...
induction, a set Q is convex if and only if every convexcombination of members of Q also belongs to Q. By definition, a convexcombination of an indexed subset {v0...
the arithmetic mean is a convexcombination (meaning its coefficients sum to 1 {\displaystyle 1} ), it can be defined on a convex space, not only a vector...