Convex cone

A convex cone (light blue). Inside of it, the light red convex cone consists of all points αx + βy with α, β > 0, for the depicted x and y. The curves on the upper right symbolize that the regions are infinite in extent.

In linear algebra, a cone—sometimes called a linear cone to distinguish it from other sorts of cones—is a subset of a real vector space that is closed under positive scalar multiplication; that is, is a cone if implies for every positive scalar . This is a broad generalization of the standard cone in Euclidean space.

A convex cone is a cone that is also closed under addition, or, equivalently, a subset of a vector space that is closed under linear combinations with positive coefficients. It follows that convex cones are convex sets.[1]

The definition of a convex cone makes sense in a vector space over any ordered field, although the field of real numbers is used most often.

  1. ^ Boyd, Stephen; Vandenberghe, Lieven (2004-03-08). Convex Optimization. Cambridge University Press. ISBN 978-0-521-83378-3.

© MMXXIII Rich X Search. We shall prevail. All rights reserved. Rich X Search