Jump to content

Dual cone and polar cone

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Yobot (talk | contribs) at 09:08, 4 October 2012 (checkwiki error 38 using AWB (8453)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
A set and its dual cone .
A set and its polar cone . The dual cone and the polar cone are symmetric to each other with respect to the origin.

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

where is the duality pairing between and , i.e. .

is always a convex cone, even if is neither convex nor a cone.

Alternatively, many authors define the dual cone in the context of a real Hilbert space, (such as equipped with the Euclidean inner product) to be what is sometimes called the internal dual cone.

Using this latter definition for , we have that when is a cone, the following properties hold:[1]

  • 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 .

Self-dual cones

A cone in a vector space is said to be self-dual if can be equipped with an inner product such that the internal dual cone relative to this inner product is equal to .[2] Those authors who define the dual cone as the internal dual cone in a real Hilbert space usually say that a cone is self-dual if it is equal to its internal dual. This is slightly different than the above definition, which permits a change of inner product. For instance, the above definition makes a cone in with ellipsoidal base self-dual, because the inner product can be changed to make the base spherical, and a with spherical base in is equal to its internal dual.

The nonnegative orthant of and the space of all positive semidefinite matrices are self-dual, as are the cones with ellipsoidal base (often called "spherical cones", "Lorentz cones", or sometimes "ice-cream cones"). So are all cones in whose base is the convex hull of a regular polygon with an odd number of vertices. A less regular example is the cone in whose base is the "house": the convex hull of a square and a point outside the square forming an equilateral triangle (of the appropriate height) with one of the sides of the square.

Polar cone

The polar of the closed convex cone is the closed convex cone and vice-versa.

For a set in , the polar cone of is the set

[3]

It can be seen that the polar cone is equal to the negative of the dual cone, i.e. .

For a closed convex cone in , the polar cone is equivalent to the polar set for .[4]

See also

References

  1. ^ Boyd, Stephen P.; Vandenberghe, Lieven (2004). Convex Optimization (pdf). Cambridge University Press. pp. 51–53. ISBN 978-0-521-83378-3. Retrieved October 15, 2011.
  2. ^ Iochum, Bruno, "Cônes autopolaires et algèbres de Jordan", Springer, 1984.
  3. ^ Rockafellar, R. Tyrrell (1997) [1970]. Convex Analysis. Princeton, NJ: Princeton University Press. pp. 121–122. ISBN 978-0-691-01586-6.
  4. ^ 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 0-415-27479-6. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)
  • Ramm, A.G. (2000). Operator theory and its applications. Providence, R.I.: American Mathematical Society. ISBN 0-8218-1990-9. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)