Convex set

{{short description|In geometry, set whose intersection with every line is a single line segment}} right|thumb|Illustration of a convex set shaped like a deformed circle. The line segment joining points ''x'' and ''y'' lies completely within the set, illustrated in green. Since this is true for any potential locations of two points within the set, the set is convex. right|thumb|Illustration of a non-convex set. The line segment joining points ''x'' and ''y'' partially extends outside of the set, illustrated in red, and the intersection of the set with the line occurs in two places, illustrated in black.

In geometry, a set of points is '''convex''' if it contains every line segment between two points in the set.<ref>{{cite book|last1=Morris|first1=Carla C.|last2=Stark|first2=Robert M.|title=Finite Mathematics: Models and Applications|date=24 August 2015|publisher=John Wiley & Sons|isbn=9781119015383|page=121|url=https://books.google.com/books?id=ZgJyCgAAQBAJ&q=convex+region&pg=PA121|access-date=5 April 2017|language=en}}</ref><ref>{{cite journal|last1=Kjeldsen|first1=Tinne Hoff|title=History of Convexity and Mathematical Programming|journal=Proceedings of the International Congress of Mathematicians|issue=ICM 2010|pages=3233–3257|doi=10.1142/9789814324359_0187|url=http://www.mathunion.org/ICM/ICM2010.4/Main/icm2010.4.3233.3257.pdf|access-date=5 April 2017|url-status=dead|archive-url=https://web.archive.org/web/20170811100026/http://www.mathunion.org/ICM/ICM2010.4/Main/icm2010.4.3233.3257.pdf|archive-date=2017-08-11}}</ref> For example, a solid cube is a convex set, but anything that is hollow or has an indent, such as a crescent shape, is not convex.

The boundary of a convex set in the plane is always a convex curve. The intersection of all the convex sets that contain a given subset {{mvar|A}} of Euclidean space is called the convex hull of {{mvar|A}}. It is the smallest convex set containing {{mvar|A}}.

A convex function is a real-valued function defined on an interval with the property that its epigraph (the set of points on or above the graph of the function) is a convex set. Convex minimization is a subfield of optimization that studies the problem of minimizing convex functions over convex sets. The branch of mathematics devoted to the study of properties of convex sets and convex functions is called convex analysis.

Spaces in which convex sets are defined include the Euclidean spaces, the affine spaces over the real numbers, and certain non-Euclidean geometries.

== Definitions == [[File:Convex supergraph.svg|right|thumb|A function is convex if and only if its epigraph, the region (in green) above its graph (in blue), is a convex set.]] Let {{mvar|S}} be a vector space or an affine space over the real numbers, or, more generally, over some ordered field (this includes Euclidean spaces, which are affine spaces). A subset {{mvar|C}} of {{mvar|S}} is convex if, for all {{mvar|x}} and {{mvar|y}} in {{mvar|C}}, the line segment connecting {{mvar|x}} and {{mvar|y}} is included in {{mvar|C}}.

This means that the affine combination {{math|(1 − ''t'')''x'' + ''ty''}} belongs to {{mvar|C}} for all {{mvar|x,y}} in {{mvar|C}} and {{mvar|t}} in the interval {{math|[0, 1]}}. This implies that convexity is invariant under affine transformations.<ref>{{cite book | last = Rockafellar | first = R. T. | author-link = R. Tyrrell Rockafellar | title = Convex Analysis | publisher = Princeton University Press | location = Princeton, NJ | orig-year = 1970 | year = 1997 | isbn = 1-4008-7317-7 | url = https://books.google.com/books?id=1TiOka9bx3sC&pg=PA12 | page = 12 }}</ref> Further, it implies that a convex set in a real or complex topological vector space is path-connected (and therefore also connected).

A set {{mvar|C}} is '''{{visible anchor|strictly convex}}''' if for every {{mvar|x}} and {{mvar|y}} in {{mvar|C}}, every point on the line segment connecting {{mvar|x}} and {{mvar|y}} other than the endpoints is inside the topological interior of {{mvar|C}}. A closed convex subset is strictly convex if and only if every one of its boundary points is an extreme point.<ref>{{Halmos A Hilbert Space Problem Book 1982|p=5}}</ref>

A set {{mvar|C}} is absolutely convex if it is convex and balanced.

===Examples=== The convex subsets of {{math|'''R'''}} (the set of real numbers) are the intervals and the points of {{math|'''R'''}}. Some examples of convex subsets of the Euclidean plane are solid regular polygons, solid triangles, and intersections of solid triangles. Some examples of convex subsets of a Euclidean 3-dimensional space are the Archimedean solids and the Platonic solids. The Kepler-Poinsot polyhedra are examples of non-convex sets.

=== Non-convex set === A set that is not convex is called a ''non-convex set''. A polygon that is not a convex polygon is sometimes called a concave polygon,<ref>{{cite book |first=Jeffrey J. |last=McConnell |year=2006 |title=Computer Graphics: Theory Into Practice |isbn=0-7637-2250-2 |page=[https://archive.org/details/computergraphics0000mcco/page/130 130] |publisher=Jones & Bartlett Learning |url=https://archive.org/details/computergraphics0000mcco/page/130 }}.</ref> and some sources more generally use the term ''concave set'' to mean a non-convex set,<ref>{{MathWorld|title=Concave|id=Concave}}</ref> but most authorities prohibit this usage.<ref>{{cite book|title=Analytical Methods in Economics|first=Akira|last=Takayama|publisher=University of Michigan Press|year=1994|isbn=9780472081356|url=https://books.google.com/books?id=_WmZA0MPlmEC&pg=PA54|page=54|quote=An often seen confusion is a "concave set". Concave and convex functions designate certain classes of functions, not of sets, whereas a convex set designates a certain class of sets, and not a class of functions. A "concave set" confuses sets with functions.}}</ref><ref>{{cite book|title=An Introduction to Mathematical Analysis for Economic Theory and Econometrics|first1=Dean|last1=Corbae|first2=Maxwell B.|last2=Stinchcombe|first3= Juraj|last3=Zeman|publisher=Princeton University Press|year=2009|isbn=9781400833085|url=https://books.google.com/books?id=j5P83LtzVO8C&pg=PT347|page=347|quote=There is no such thing as a concave set.}}</ref>

The complement of a convex set, such as the epigraph of a concave function, is sometimes called a ''reverse convex set'', especially in the context of mathematical optimization.<ref>{{cite journal | last = Meyer | first = Robert | journal = SIAM Journal on Control and Optimization | mr = 0312915 | pages = 41–54 | title = The validity of a family of optimization methods | volume = 8 | year = 1970| doi = 10.1137/0308003 | url = https://minds.wisconsin.edu/bitstream/handle/1793/57508/TR28.pdf?sequence=1 }}.</ref>

== Properties == Given {{mvar|r}} points {{math|''u''1, ..., ''ur''}} in a convex set {{mvar|S}}, and {{mvar|r}} nonnegative numbers {{math|''λ''1, ..., ''λr''}} such that {{math|''λ''1 + ... + ''λr'' {{=}} 1}}, the affine combination <math display=block>\sum_{k=1}^r\lambda_k u_k</math> belongs to {{mvar|S}}. As the definition of a convex set is the case {{math|1=''r'' = 2}}, this property characterizes convex sets.

Such an affine combination is called a convex combination of {{math|''u''1, ..., ''ur''}}. The '''convex hull''' of a subset {{mvar|S}} of a real vector space is defined as the intersection of all convex sets that contain {{mvar|S}}. More concretely, the convex hull is the set of all convex combinations of points in {{mvar|S}}. In particular, this is a convex set.

A ''(bounded) convex polytope'' is the convex hull of a finite subset of some Euclidean space {{math|'''R'''''n''}}.

=== Intersections and unions === The collection of convex subsets of a vector space, an affine space, or a Euclidean space has the following properties:<ref name="Soltan" >Soltan, Valeriu, ''Introduction to the Axiomatic Theory of Convexity'', Ştiinţa, Chişinău, 1984 (in Russian). </ref><ref name="Singer" >{{cite book|last=Singer|first=Ivan|title=Abstract convex analysis|series=Canadian Mathematical Society series of monographs and advanced texts|publisher=John Wiley & Sons, Inc.|location=New York|year= 1997|pages=xxii+491|isbn=0-471-16015-6|mr=1461544}}</ref> #The empty set and the whole space are convex. #The intersection of any collection of convex sets is convex. #The ''union'' of a collection of convex sets is convex if those sets form a chain (a totally ordered set) under inclusion. For this property, the restriction to chains is important, as the union of two convex sets need not be convex.

=== Closed convex sets === Closed convex sets are convex sets that contain all their limit points. They can be characterised as the intersections of ''closed half-spaces'' (sets of points in space that lie on and to one side of a hyperplane).

From what has just been said, it is clear that such intersections are convex, and they will also be closed sets. To prove the converse, i.e., every closed convex set may be represented as such intersection, one needs the supporting hyperplane theorem in the form that for a given closed convex set {{mvar|C}} and point {{mvar|P}} outside it, there is a closed half-space {{mvar|H}} that contains {{mvar|C}} and not {{mvar|P}}. The supporting hyperplane theorem is a special case of the Hahn–Banach theorem of functional analysis.

=== Face of a convex set === A '''face''' of a convex set <math>C</math> is a convex subset <math>F</math> of <math>C</math> such that whenever a point <math>p</math> in <math>F</math> lies strictly between two points <math>x</math> and <math>y</math> in <math>C</math>, both <math>x</math> and <math>y</math> must be in <math>F</math>.{{sfn | Rockafellar| 1997 | p=162}} Equivalently, for any <math>x,y\in C</math> and any real number <math>0<t<1</math> such that <math>(1-t)x+ty</math> is in <math>F</math>, <math>x</math> and <math>y</math> must be in <math>F</math>. According to this definition, <math>C</math> itself and the empty set are faces of <math>C</math>; these are sometimes called the ''trivial faces'' of <math>C</math>. An '''extreme point''' of <math>C</math> is a point that is a face of <math>C</math>.

Let <math>C</math> be a convex set in <math>\R^n</math> that is compact (or equivalently, closed and bounded). Then <math>C</math> is the convex hull of its extreme points.{{sfn | Rockafellar| 1997 | p=166}} More generally, each compact convex set in a locally convex topological vector space is the closed convex hull of its extreme points (the Krein–Milman theorem).

For example: * A triangle in the plane (including the region inside) is a compact convex set. Its nontrivial faces are the three vertices and the three edges. (So the only extreme points are the three vertices.) * The only nontrivial faces of the closed unit disk <math>\{ (x,y) \in \R^2: x^2+y^2 \leq 1 \}</math> are its extreme points, namely the points on the unit circle <math>S^1 = \{ (x,y) \in \R^2: x^2+y^2=1 \}</math>.

=== Convex sets and rectangles === Let {{mvar|C}} be a convex body in the plane (a convex set whose interior is non-empty). We can inscribe a rectangle ''r'' in {{mvar|C}} such that a homothetic copy ''R'' of ''r'' is circumscribed about {{mvar|C}}. The positive homothety ratio is at most 2 and:<ref>{{Cite journal | doi = 10.1007/BF01263495| title = Approximation of convex bodies by rectangles| journal = Geometriae Dedicata| volume = 47| pages = 111–117| year = 1993| last1 = Lassak | first1 = M. | s2cid = 119508642}}</ref> <math display=block>\tfrac{1}{2} \cdot\operatorname{Area}(R) \leq \operatorname{Area}(C) \leq 2\cdot \operatorname{Area}(r)</math>

=== Blaschke-Santaló diagrams === The set <math>\mathcal{K}^2</math> of all planar convex bodies can be parameterized in terms of the convex body diameter ''D'', its inradius ''r'' (the biggest circle contained in the convex body) and its circumradius ''R'' (the smallest circle containing the convex body). In fact, this set can be described by the set of inequalities given by<ref name=":0">{{Cite journal|last=Santaló|first=L.|date=1961|title=Sobre los sistemas completos de desigualdades entre tres elementos de una figura convexa planas|journal=Mathematicae Notae|volume=17|pages=82–104}}</ref><ref name=":1">{{Cite journal|last1=Brandenberg|first1=René|last2=González Merino|first2=Bernardo|date=2017|title=A complete 3-dimensional Blaschke-Santaló diagram|url=http://mia.ele-math.com/20-22|journal=Mathematical Inequalities & Applications|language=en|issue=2|pages=301–348|doi=10.7153/mia-20-22|issn=1331-4343|doi-access=free|arxiv=1404.6808}}</ref> <math display=block>2r \le D \le 2R</math> <math display=block>R \le \frac{\sqrt{3}}{3} D</math> <math display=block>r + R \le D</math> <math display=block>D^2 \sqrt{4R^2-D^2} \le 2R (2R + \sqrt{4R^2 -D^2})</math> and can be visualized as the image of the function ''g'' that maps a convex body to the {{math|'''R'''2}} point given by (''r''/''R'', ''D''/2''R''). The image of this function is known a (''r'', ''D'', ''R'') Blachke-Santaló diagram.<ref name=":1" /> [[File:Blaschke-Santaló_diagram_for_planar_convex_bodies.pdf|alt=|center|thumb|673x673px|Blaschke-Santaló (''r'', ''D'', ''R'') diagram for planar convex bodies. <math>\mathbb{L}</math> denotes the line segment, <math>\mathbb{I}_{\frac{\pi}{3}}</math> the equilateral triangle, <math>\mathbb{RT}</math> the Reuleaux triangle and <math>\mathbb{B}_2</math> the unit circle.]] Alternatively, the set <math>\mathcal{K}^2</math> can also be parametrized by its width (the smallest distance between any two different parallel support hyperplanes), perimeter and area.<ref name=":0" /><ref name=":1" />

=== Other properties === Let ''X'' be a topological vector space and <math>C \subseteq X</math> be convex. * <math>\operatorname{Cl} C</math> and <math>\operatorname{Int} C</math> are both convex (i.e. the closure and interior of convex sets are convex). * If <math>a \in \operatorname{Int} C</math> and <math>b \in \operatorname{Cl} C</math> then <math>[a, b[ \, \subseteq \operatorname{Int} C</math> (where <math>[a, b[ \, := \left\{ (1 - r) a + r b : 0 \leq r < 1 \right\}</math>). * If <math>\operatorname{Int} C \neq \emptyset</math> then: ** <math>\operatorname{cl} \left( \operatorname{Int} C \right) = \operatorname{Cl} C</math>, and ** <math>\operatorname{Int} C = \operatorname{Int} \left( \operatorname{Cl} C \right) = C^i</math>, where <math>C^{i}</math> is the algebraic interior of ''C''.

== Convex hulls and Minkowski sums ==

=== Convex hulls === {{Main|convex hull}} Every subset {{mvar|A}} of the vector space is contained within a smallest convex set (called the ''convex hull'' of {{mvar|A}}), namely the intersection of all convex sets containing {{mvar|A}}. The convex-hull operator Conv() has the characteristic properties of a closure operator: * ''extensive'': {{math|''S'' ⊆ Conv(''S'')}}, * ''non-decreasing'': {{math|''S'' ⊆ ''T''}} implies that {{math|Conv(''S'') ⊆ Conv(''T'')}}, and * ''idempotent'': {{math|Conv(Conv(''S'')) {{=}} Conv(''S'')}}. The convex-hull operation is needed for the set of convex sets to form a lattice, in which the "''join''" operation is the convex hull of the union of two convex sets <math display=block>\operatorname{Conv}(S)\vee\operatorname{Conv}(T) = \operatorname{Conv}(S\cup T) = \operatorname{Conv}\bigl(\operatorname{Conv}(S)\cup\operatorname{Conv}(T)\bigr).</math> The intersection of any collection of convex sets is itself convex, so the convex subsets of a (real or complex) vector space form a complete lattice.

=== Minkowski addition === {{Main|Minkowski addition}} [[File:Minkowski sum graph - vector version.svg|thumb|alt=Three squares are shown in the nonnegative quadrant of the Cartesian plane. The square {{math|''Q''1 {{=}} [0, 1] × [0, 1]}} is green. The square {{math|''Q''2 {{=}} [1, 2] × [1, 2]}} is brown, and it sits inside the turquoise square {{math|1=Q1+Q2{{=}}[1,3]×[1,3]}}.|Minkowski addition of sets. The sum of the squares Q1=[0,1]2 and Q2=[1,2]2 is the square Q1+Q2=[1,3]2.]]

In a real vector-space, the ''Minkowski sum'' of two (non-empty) sets, {{math|''S''1}} and {{math|''S''2}}, is defined to be the set {{math|''S''1 + ''S''2}} formed by the addition of vectors element-wise from the summand-sets <math display=block>S_1+S_2=\{x_1+x_2: x_1\in S_1, x_2\in S_2\}.</math> More generally, the ''Minkowski sum'' of a finite family of (non-empty) sets {{math|''Sn''}} is  the set  formed by element-wise addition of vectors <math display=block> \sum_n S_n = \left \{ \sum_n x_n : x_n \in S_n \right \}.</math>

For Minkowski addition, the ''zero set'' {{math|{0} }} containing only the zero vector {{math|0}} has special importance: For every non-empty subset S of a vector space <math display=block>S+\{0\}=S;</math> in algebraic terminology, {{math|{0} }} is the identity element of Minkowski addition (on the collection of non-empty sets).<ref>The empty set is important in Minkowski addition, because the empty set annihilates every other subset: For every subset {{mvar|S}} of a vector space, its sum with the empty set is empty: <math>S+\emptyset=\emptyset</math>.</ref>

=== Convex hulls of Minkowski sums === Minkowski addition behaves well with respect to the operation of taking convex hulls, as shown by the following proposition:

Let {{math|''S''1, ''S''2}} be subsets of a real vector-space, the convex hull of their Minkowski sum is the Minkowski sum of their convex hulls <math display=block>\operatorname{Conv}(S_1+S_2)=\operatorname{Conv}(S_1)+\operatorname{Conv}(S_2).</math>

This result holds more generally for each finite collection of non-empty sets: <math display=block>\text{Conv}\left ( \sum_n S_n \right ) = \sum_n \text{Conv} \left (S_n \right).</math>

In mathematical terminology, the operations of Minkowski summation and of forming convex hulls are commuting operations.<ref>Theorem 3 (pages 562–563): {{cite journal|first1=M.|last1=Krein|author-link1=Mark Krein|first2=V.|last2=Šmulian|year=1940|title=On regularly convex sets in the space conjugate to a Banach space|journal=Annals of Mathematics |series=Second Series| volume=41 |issue=3 |pages=556–583|jstor=1968735|doi=10.2307/1968735}}</ref><ref name="Schneider">For the commutativity of Minkowski addition and convexification, see Theorem 1.1.2 (pages 2–3) in Schneider; this reference discusses much of the literature on the convex hulls of Minkowski sumsets in its "Chapter 3 Minkowski addition" (pages 126–196): {{cite book|last=Schneider|first=Rolf|title=Convex bodies: The Brunn–Minkowski theory|series=Encyclopedia of mathematics and its applications|volume=44|publisher=Cambridge University Press|location=Cambridge|year=1993|pages=xiv+490|isbn=0-521-35220-7|mr=1216521|url=https://archive.org/details/convexbodiesbrun0000schn}}</ref>

=== Minkowski sums of convex sets === The Minkowski sum of two compact convex sets is compact. The sum of a compact convex set and a closed convex set is closed.<ref>Lemma 5.3: {{cite book|first1=C.D.|last1= Aliprantis|first2=K.C.| last2=Border|title=Infinite Dimensional Analysis, A Hitchhiker's Guide| publisher=Springer| location=Berlin|year=2006|isbn=978-3-540-29587-7}}</ref>

The following famous theorem, proved by Dieudonné in 1966, gives a sufficient condition for the difference of two closed convex subsets to be closed.<ref name="Zalinescu p. 7">{{cite book|last=Zălinescu|first=C.|title=Convex analysis in general vector spaces|url=https://archive.org/details/convexanalysisge00zali_934|url-access=limited|publisher=World Scientific Publishing Co., Inc|location= River Edge, NJ |date= 2002|page=[https://archive.org/details/convexanalysisge00zali_934/page/n27 7]|isbn=981-238-067-1|mr=1921556}}</ref> It uses the concept of a '''recession cone''' of a non-empty convex subset ''S'', defined as: <math display=block>\operatorname{rec} S = \left\{ x \in X \, : \, x + S \subseteq S \right\},</math> where this set is a convex cone containing <math>0 \in X </math> and satisfying <math>S + \operatorname{rec} S = S</math>. Note that if ''S'' is closed and convex then <math>\operatorname{rec} S</math> is closed and for all <math>s_0 \in S</math>, <math display=block>\operatorname{rec} S = \bigcap_{t > 0} t (S - s_0).</math>

'''Theorem''' (Dieudonné). Let ''A'' and ''B'' be non-empty, closed, and convex subsets of a locally convex topological vector space such that <math>\operatorname{rec} A \cap \operatorname{rec} B</math> is a linear subspace. If ''A'' or ''B'' is locally compact then ''A'' − ''B'' is closed.

== Generalizations and extensions for convexity == The notion of convexity in the Euclidean space may be generalized by modifying the definition in some or other aspects. The common name "generalized convexity" is used, because the resulting objects retain certain properties of convex sets.

=== Star-convex (star-shaped) sets === {{main|Star domain}} Let {{mvar|C}} be a set in a real or complex vector space. {{mvar|C}} is '''star convex (star-shaped)''' if there exists an {{math|''x''0}} in {{mvar|C}} such that the line segment from {{math|''x''0}} to any point {{mvar|y}} in {{mvar|C}} is contained in {{mvar|C}}. Hence a non-empty convex set is always star-convex but a star-convex set is not always convex.

=== Orthogonal convexity === {{main|Orthogonal convex hull}} An example of generalized convexity is '''orthogonal convexity'''.<ref>Rawlins G.J.E. and Wood D, "Ortho-convexity and its generalizations", in: ''Computational Morphology'', 137-152. Elsevier, 1988.</ref>

A set {{mvar|S}} in the Euclidean space is called '''orthogonally convex''' or '''ortho-convex''', if any segment parallel to any of the coordinate axes connecting two points of {{mvar|S}} lies totally within {{mvar|S}}. It is easy to prove that an intersection of any collection of orthoconvex sets is orthoconvex. Some other properties of convex sets are valid as well.

=== Non-Euclidean geometry === The definition of a convex set and a convex hull extends naturally to geometries which are not Euclidean by defining a geodesically convex set to be one that contains the geodesics joining any two points in the set.

=== Order topology === Convexity can be extended for a totally ordered set {{mvar|X}} endowed with the order topology.<ref>Munkres, James; ''Topology'', Prentice Hall; 2nd edition (December 28, 1999). {{ISBN|0-13-181629-2}}.</ref>

Let {{math|''Y'' ⊆ ''X''}}. The subspace {{mvar|Y}} is a convex set if for each pair of points {{math|''a'', ''b''}} in {{mvar|Y}} such that {{math|''a'' ≤ ''b''}}, the interval {{math|[''a'', ''b''] {{=}} {''x'' ∈ ''X'' {{!}} ''a'' ≤ ''x'' ≤ ''b''} }} is contained in {{mvar|Y}}. That is, {{mvar|Y}} is convex if and only if for all {{math|''a'', ''b''}} in {{mvar|Y}}, {{math|''a'' ≤ ''b''}} implies {{math|[''a'', ''b''] ⊆ ''Y''}}.

A convex set is {{em|not}} connected in general: a counter-example is given by the subspace {1,2,3} in {{math|'''Z'''}}, which is both convex and not connected.

=== Convexity spaces === The notion of convexity may be generalised to other objects, if certain properties of convexity are selected as axioms.

Given a set {{mvar|X}}, a '''convexity''' over {{mvar|X}} is a collection {{math|''𝒞''}} of subsets of {{mvar|X}} satisfying the following axioms:<ref name="Soltan"/><ref name="Singer"/><ref name="vanDeVel" >{{cite book|last=van De Vel|first=Marcel L. J.|title=Theory of convex structures|series=North-Holland Mathematical Library|publisher=North-Holland Publishing Co.|location=Amsterdam|year= 1993|pages=xvi+540|isbn=0-444-81505-8|mr=1234493}}</ref>

#The empty set and {{mvar|X}} are in {{math|''𝒞''}}. #The intersection of any collection from {{math|''𝒞''}} is in {{math|''𝒞''}}. #The union of a chain (with respect to the inclusion relation) of elements of {{math|''𝒞''}} is in {{math|''𝒞''}}.

The elements of {{math|''𝒞''}} are called convex sets and the pair {{math|(''X'', ''𝒞'')}} is called a '''convexity space'''. For the ordinary convexity, the first two axioms hold, and the third one is trivial.

For an alternative definition of abstract convexity, more suited to discrete geometry, see the ''convex geometries'' associated with antimatroids.

=== Convex spaces === {{main|Convex space}}

Convexity can be generalised as an abstract algebraic structure: a space is convex if it is possible to take convex combinations of points.

== References == {{reflist|30em}}

==External links== {{Wiktionary}} * {{springer|title=Convex subset|id=p/c026380|mode=cs1}} * [http://www.fmf.uni-lj.si/~lavric/lauritzen.pdf Lectures on Convex Sets], notes by Niels Lauritzen, at Aarhus University, March 2010.

{{DEFAULTSORT:Convex Set}} Category:Convex analysis Category:Convex geometry