Minimization of entropy functionals
arXiv:0710.1462 · doi:10.1016/j.jmaa.2008.04.048
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.
References in corpus (2)
Cited by in corpus (11)
- Entropic regularization of continuous optimal transport problems
- Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities
- Entropic Projections and Dominating Points
- Orlicz space regularization of continuous optimal transport problems
- Convex minimization problems with weak constraint qualifications
- A precise bare simulation approach to the minimization of some distances. Foundations
- Convex Risk Minimization and Conditional Probability Estimation
- Diffusion processes with weak constraint through penalization approximation
- Multivariate truncated moments problems and maximum entropy
- On the Geometry of Maximum Entropy Problems
- Hidden stochastic, quantum and dynamic information of Markov diffusion process and its evaluation by an entropy integral measure under the impulse controls actions, applied to information observer