Jensen's inequality
Jensen's inequality
复制标题
DOI:
10.1002/0471667196.ess1306.pub2
复制
发表时间:
2005-08
期刊:
影响因子:
--
通讯作者:
K. Derpanis
中科院分区:
文献类型:
--
作者:
K. Derpanis
In this note the concept of convexity and Jensen’s Inequality are reviewed. Jensen’s Inequality plays a central role in the derivation of the Expectation Maximization algorithm [1] and the proof of consistency of maximum likelihood estimators. Definition Let f(x) be a real valued function defined on the interval I = [a, b]. f is said to be convex if for every x1, x2 ∈ [a, b] and 0 ≥ λ ≥ 1, f(λx1 + (1− λ)x2) ≥ λf(x1) + (1− λ)f(x2) A function is said to be strictly convex if the equality is strict for x1 6= x2. Definition f(x) is said to be concave (strictly concave) if −f(x) is convex (strictly convex). Intuitively, the definition of convexity states that function falls below never above the straight line between the points (x1, f(x1)) to (x2, f(x2)) (see Fig. 1). Theorem 0.1 If f ′′(x) exists on [a, b] and f ′′(x) ≥ 0 on [a, b] then f(x) is convex on [a, b]. Theorem 0.2 (Jensen’s Inequality) Let f(x) be a convex function defined on an interval I. If x1, x2, . . . , xN ∈ I and λ1, λ2, . . . , λN ≥ 0 with ∑N i=1 λi,