On Lagrange multipliers in convex entropy minimization

Abstract

Based on a characterization of the optimality of a feasible solution of a convex entropy minimization problem, one shows that the feasible solutions obtained using formally the Lagrange multipliers method are optimal.

10 pages

References in corpus (1)

• Series of convex functions: subdifferential, conjugate and applications to entropy minimization