  In information theory, some optimization problems result in convex
optimization problems on strictly convex functionals of probability densities.
In this note, we study these problems and show conditions of minimizers and the
uniqueness of the minimizer if there exist a minimizer.
