2000 character limit reached
Convex Optimization on Functionals of Probability Densities (2002.06488v2)
Published 16 Feb 2020 in cs.IT, cs.LG, and math.IT
Abstract: 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.