Convex conjugate
From Wikipedia, the free encyclopedia
In mathematics, convex conjugation is a generalization of the Legendre transformation. It is also known as Legendre-Fenchel transformation or Fenchel transformation.
Contents |
[edit] Definition
Let X be a real normed vector space, and let X * be the dual space to X. Denote the dual pairing by
For a function
taking values on the extended real number line the convex conjugate
is defined by
or, equivalently, by
[edit] Examples
The convex conjugate of an affine function
is
The convex conjugate of the absolute value function
is
The convex conjugate of the exponential function is
Convex conjugate and Legendre transform of the exponential function agree except that the domain of the convex conjugate is strictly larger as the Legendre transform is only defined for positive real numbers.
[edit] Properties
The convex conjugate of a closed convex function is again a closed convex function. The convex conjugate of a polyhedral convex function (a convex function with polyhedral epigraph) is again a polyhedral convex function.
Convex-conjugation is order-reversing: if f ? g then f* ? g*. Here f ? g if and only if f(x) ? g(x) for all x.
[edit] Biconjugate
The convex conjugate of a function is always lower semi-continuous. The biconjugate f** (the convex conjugate of the convex conjugate) is also the closed convex hull, i.e. the largest lower semi-continuous convex function smaller than f. Therefore, f = f** if and only if f is convex and lower semi-continuous.
[edit] Fenchel's inequality
For any proper convex function f and its convex conjugate f* Fenchel's inequality (also known as the Fenchel-Young inequality) holds:
[edit] Behavior under linear transformations
Let A be a linear transformation from Rn to Rm. For any convex function f on Rn, one has
where A* is the adjoint operator of A defined by
A closed convex function f is symmetric with respect to a given set G of orthogonal linear transformations,
if and only if its convex conjugate f* is symmetric with respect to G.
[edit] Infimal convolution
The infimal convolution of two functions f and g is defined as
Let f1, …, fm be proper convex functions on Rn. Then
[edit] References
- Arnol'd, Vladimir Igorevich (1989). Mathematical Methods of Classical Mechanics (second edition). Springer. ISBN 0-387-96890-3.
- Rockafellar, Ralph Tyrell (1996). Convex Analysis. Princeton University Press. ISBN 0-691-01586-4.