Convex and discrete geometry Convex sets: basic notions Concept
Dual cone
Summary
The dual cone of a set in is the set of vectors that make a nonnegative dot product with every vector of . It is always a closed convex cone, and for a closed convex cone the dual of the dual is again. Dual cones are the geometric side of duality in linear and conic optimisation, and they appear in Farkas-type theorems of the alternative.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | QFY1JR1TK4 |
|---|---|
| URI | m2://QFY1JR1TK4 |
| Kind | concept |
| Writing | W0 stub |
| MSC | 52A20, 90C25 |
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.