The function φ:(a,b)→R is convex on (a,b) if and only if: ∀0≤λ≤1,∀a<x,y≤b: φ(λx+(1−λ)y)≤λφ(x)+(1−λ)φ(y) equivalently ∀a<s<t<u<b: t−sφ(t)−φ(s)≤u−tφ(u)−φ(t) # Definition (474) The function f:K→R, where K is a convex subset of Rn, is called convex on K if ∀x1,x2∈K and λ∈[0,1]f(λx1+(1−λ)x2)≤λf(x1)+(1−λ)f(x2) Also if strict inequality holds whenever x1=x2 and 0<λ<1, then f is called strictly convex.
Proposition (Properties of Convex Functions)
Continuity: Convex functions are continuous on K (except possibly the boundary of K)
Monotonicity of derivative equivalent to convexity:K⊂R,f∈C2⟹(f convex⟺f′′≥0)
If K⊂Rn and f is twice-differentiable in all its variables, then f is convex if and only if it’s Hessian∇2f=[δxiδxjδ2f]i,j is positive semidefinite.