2000 character limit reached
Minimization of entropy functionals
Published 8 Oct 2007 in math.OC, cs.IT, math.IT, and math.PR | (0710.1462v1)
Abstract: Entropy functionals (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. Dual equalities and characterizations of the minimizers are obtained with weak constraint qualifications.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.