Given a finite number of vectors in a real vector space, a conical combination, conic combination, conical sum, or weighted sum[1][2][3] of these vectors is a vector of the form

where are non-negative real numbers.

The name derives from the fact that the set of all conical sum of vectors defines a cone (possibly in a lower-dimensional subspace).

Conical hull

edit

The set of all conical combinations for a given set is called the conical hull (or conic hull) of and denoted [1] or .[2] That is,

By taking , it follows the zero vector (origin) belongs to all conical hulls (since the summation becomes an empty sum).

The conical hull of a set is a convex set. In fact, it is the intersection of all convex cones containing S plus the origin.[1] If is a compact set (in particular, when it is a finite non-empty set of points), then the condition "plus the origin" is unnecessary.

If we discard the origin, we can divide all coefficients by their sum to see that a conical combination is a convex combination scaled by a positive factor.

In the plane, the conical hull of a circle passing through the origin is the open half-plane defined by the tangent line to the circle at the origin plus the origin.

Therefore, "conical combinations" and "conical hulls" are in fact "convex conical combinations" and "convex conical hulls" respectively.[1] Moreover, the above remark about dividing the coefficients while discarding the origin implies that the conical combinations and hulls may be considered as convex combinations and convex hulls in the projective space.

While the convex hull of a compact set is also a compact set, this is not so for the conical hull; first of all, the latter one is unbounded. Moreover, it is not even necessarily a closed set: a counterexample is a sphere passing through the origin, with the conical hull being an open half-space plus the origin. However, if is a non-empty convex compact set which does not contain the origin, then the convex conical hull of is a closed set.[1]

See also

edit
edit

References

edit
  1. ^ a b c d e Convex Analysis and Minimization Algorithms by Jean-Baptiste Hiriart-Urruty, Claude Lemaréchal, 1993, ISBN 3-540-56850-6, pp. 101, 102
  2. ^ a b Mathematical Programming, by Melvyn W. Jeter (1986) ISBN 0-8247-7478-7, p. 68
  3. ^ Convex Optimization, by Stephen Boyd and Lieven Vandenberghe (2004) ISBN 978-0521833783, p. 25

📚 Artikel Terkait di Wikipedia

Linear combination

combination (they form a convex set), but not conical or affine combinations (or linear), and positive measures are closed under conical combination but

Convex combination

function is a convex combination of n {\displaystyle n} so-called component densities. A conical combination is a linear combination with nonnegative coefficients

Affine combination

of b→ with coefficients from the rows in A. Convex combination Conical combination Linear combination Affine space Affine geometry Affine hull Gallier,

Hilbert basis (linear programming)

of integer vectors in C such that every integer vector in C is a conical combination of the vectors in the Hilbert basis with integer coefficients. Given

Carathéodory's theorem (convex hull)

\mathbb {R} ^{d}} , then x {\displaystyle x} can be written as the conical combination of at most d {\displaystyle d} points in P {\displaystyle P} . Two

Coin problem

find the largest integer that cannot be expressed as an integer conical combination of these numbers, i.e., as a sum: k 1 a 1 + k 2 a 2 + ⋯ + k n a n

Weight function

{\displaystyle w\colon A\to \mathbb {R} ^{+}} , the weighted sum or conical combination is defined as ∑ a ∈ A f ( a ) w ( a ) . {\displaystyle \sum _{a\in

Product integral

) {\displaystyle f(x)=\sum _{k=1}^{n}a_{k}I_{A_{k}}(x)} (i.e. a conical combination of the indicator functions for some disjoint measurable sets A 1