Minimization of entropy functionals

Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Primal attainment, dual equalities, dual attainment and characterizations of the minimizers are obtained with weak constraint qualifications. These results improve several aspects of the literature on the subject.