Some Families of Jensen-like Inequalities with Application to Information Theory

It is well known that the traditional Jensen inequality is proved by lower bounding the given convex function, <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>f</mi><mo>(</mo>&l...

Full description

Bibliographic Details
Main Author: Neri Merhav
Format: Article
Language:English
Published: MDPI AG 2023-05-01
Series:Entropy
Subjects:
Online Access:https://www.mdpi.com/1099-4300/25/5/752

Similar Items