Math 2.0

Convex and discrete geometry Convex sets: basic notions Concept

Proper cone

Summary

A proper cone in ℝn\R^n is a closed convex cone with nonempty interior that contains no line. Proper cones define the generalized inequalities x⪯Ky  ⟺  y−x∈Kx \preceq_K y \iff y - x \in K used in conic and semidefinite optimisation. The nonnegative orthant, the second-order cone and the cone of positive semidefinite matrices are the standard examples. The dual cone of a proper cone is again proper.

Further reading

  1. Web https://en.wikipedia.org/wiki/Convex_cone
About this page
TagZ5T0SEF3XA
URIm2://Z5T0SEF3XA
Kindconcept
WritingW0 stub
MSC52A20, 90C25
SpecializesPointed cone

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • 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

Definitions