In convex geometry, 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 up to 1.
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
As a particular example, every convex combination of two points lies on the line segment between the points.
All convex combinations are within the convex hull of the given points. In fact, the collection of all such convex combinations of points in the set constitutes the convex hull of the set.
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).
Read more about Convex Combination: Other Objects, Related Constructions
Famous quotes containing the word combination:
“We attempt to remember our collective American childhood, the way it was, but what we often remember is a combination of real past, pieces reshaped by bitterness and love, and, of course, the video past—the portrayals of family life on such television programs as “Leave it to Beaver” and “Father Knows Best” and all the rest.”
—Richard Louv (20th century)