Math 2.0

Convex and discrete geometry Convex sets: basic notions Concept

Fenchel conjugate

Summary

The Fenchel conjugate, or convex conjugate, of a function ff on a vector space is the function f∗f^* on the dual space given by f∗(y)=sup⁡x(⟨y,x⟩−f(x))f^*(y) = \sup_x \big(\ip{y}{x} - f(x)\big). It is always convex and lower semicontinuous, and for proper convex lower semicontinuous ff one has f∗∗=ff^{**} = f. It extends the classical Legendre transformation to functions that need not be differentiable. It is the basic tool of duality in convex optimization.

Where this leads

2 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Convex_conjugate
About this page
TagT7V2VPY61S
URIm2://T7V2VPY61S
Kindconcept
WritingW0 stub
MSC52A41, 26B25, 90C46
Same as

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.

What links here

Definitions

Results about this

Used by