Dual cone and polar cone
Appearance


Dual cone and polar cone are closely related concepts in convex analysis, a branch of mathematics.
Dual cone
The dual cone of a subset in a linear space , e.g. Euclidean space , with topological dual space is the set
is always a convex cone, even if is neither convex nor a cone.
When is a cone, the following properties hold:
- A non-zero vector is in if and only if both of the following conditions hold: (i) is a normal at the origin of a hyperplane that supports . (ii) and lie on the same side of that supporting hyperplane.
- is closed and convex.
- implies .
- If has nonempty interior, then is pointed, i.e. contains no line in its entirety.
- If is a cone and the closure of is pointed, then has nonempty interior.
- is the closure of the smallest convex cone containing .
A cone is said to be self-dual if . The nonnegative orthant of and the space of all positive semidefinite matrices are self-dual.
Polar cone

For a set in , the polar cone of is the set
For a closed convex cone in , the polar cone cone is equal to the negative of the dual cone, i.e. .
References
- ^ Aliprantis, C.D.; Border, K.C. (2007). Infinite Dimensional Analysis: A Hitchhiker's Guide (3 ed.). Springer. p. 215. doi:10.1007/3-540-29587-9. ISBN 978-3-540-32696-0.
- Goh, C. J. (2002). Duality in optimization and variational inequalities. London; New York: Taylor & Francis. ISBN 0415274796.
{{cite book}}
: Unknown parameter|coauthors=
ignored (|author=
suggested) (help)
- Boltyanski, V. G. (1997). Excursions into combinatorial geometry. New York: Springer. ISBN 3540613412.
{{cite book}}
: Unknown parameter|coauthors=
ignored (|author=
suggested) (help)CS1 maint: publisher location (link)
- Ramm, A.G. (2000). Operator theory and its applications. Providence, R.I.: American Mathematical Society. ISBN 0821819909.
{{cite book}}
: Unknown parameter|coauthors=
ignored (|author=
suggested) (help)