A Conic Programming Approach to Generalized Tchebycheff Inequalities
Luis Zuluaga (lzuluagaandrew.cmu.edu)
Abstract: Consider the problem of finding optimal bounds on the expected value of piece-wise polynomials over all measures with a given set of moments. We show that this problem can be studied within the framework of conic programming. Relying on a key approximation result for conic programming, we show that these bounds can be numerically computed or approximated via semidefinite programming. Also, we illustrate how our approach can be applied to problems in probability, finance and inventory theory.
Keywords: Tchebycheff bounds, cones of moments, positive polynomials, semidefinite programming
Category 1: Convex and Nonsmooth Optimization (Convex Optimization )
Category 2: Linear, Cone and Semidefinite Programming (Semi-definite Programming )
Citation: Mathematics of Operations Research 30 (2005) pp. 369--388.
Entry Submitted: 10/30/2002
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|