An iterative algorithm to bound partial moments

Abstract

This paper presents an iterative algorithm that bounds the lower and upper partial moments of an arbitrary univariate random variable X by using the information contained in a sequence of finite moments of X . The obtained bounds on the partial moments imply bounds on the moments of the transformation f (X ) for a certain function f : R → R. Two examples illustrate the performance of the algorithm.