Convex conjugates: definition, optimization and geometry
On this page 2 headings
For a function f, its convex conjugate is
with the supremum taken over the domain of f. We fix t, vary u, and take the largest possible objective value. The conjugate is a new function of t. It is convex, even when f is not convex.
Conjugate of a quadratic
Start with
for all real u. Then
Differentiate with respect to u:
The stationary point is .
The second derivative is , so this is the unique maximum.
Substitute :
For , the maximizing input is and the maximum value is
Geometric interpretation: for convex differentiable f, a supporting line of slope t has the form
when the supremum is attained. Its vertical intercept is .
The conjugate used for KL divergence
Use
for , extended continuously by
the optimization domain is .
Form . Its derivative for is .
Set it to zero:
hence .
The objective is strictly concave on (second derivative ).
Substitution gives
Note the distinction between
used in the KL f-divergence, and
its convex conjugate. They are different functions.
