Convex and discrete geometry Convex sets: basic notions Concept
Convex combination
Summary
A convex combination of finitely many points is a weighted sum of the points whose weights are nonnegative and add up to . It is the special kind of affine combination in which no weight is negative. The convex hull of a set is exactly the set of all convex combinations of its points. A convex set is a set closed under convex combinations. So convex combinations are the basic operation of convex geometry.
Where this leads
5 pages build on this one.
Further reading
About this page
| Tag | 21SXYJYC59 |
|---|---|
| URI | m2://21SXYJYC59 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52A05, 52A20 |
| Specializes | Affine combination |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Used by
- de Boor's algorithm
- de Casteljau's algorithm
- Minkowski–Carathéodory theorem
- Jensen inequality as a functional inequality