Convex and discrete geometry Convex sets: basic notions Concept
Proper cone
Summary
A proper cone in is a closed convex cone with nonempty interior that contains no line. Proper cones define the generalized inequalities 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
About this page
| Tag | Z5T0SEF3XA |
|---|---|
| URI | m2://Z5T0SEF3XA |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52A20, 90C25 |
| Specializes | Pointed 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.