On the sum of squared logarithms inequality and related inequalities
We consider the sum of squared logarithms inequality and investigate possible connections with the theory of majorization. We also discuss alternative sufficient conditions on two sets of vectors a,b∈Rn+ so that ∑ni=1(logai)2 ≤ ∑ni=1(logbi)2. Generalizations of some inequalities from information theory are obtained, including a generalized information inequality and a generalized log sum inequality, which states for a,b∈Rn+ and k1,...,kn∈[0,∞): ∑ni=1ailog∏ms=1(aibi+ks) ≥ log∏ms=1(1+ks).
Share and cite
Could not load citation form. Default citation form is displayed.