Generalized Chebyshev Bounds via Semidefinite Programming

@article{Vandenberghe2007GeneralizedCB,
  title={Generalized Chebyshev Bounds via Semidefinite Programming},
  author={Lieven Vandenberghe and Stephen P. Boyd and Katherine Comanor},
  journal={SIAM Review},
  year={2007},
  volume={49},
  pages={52-64}
}
A sharp lower bound on the probability of a set defined by quadratic inequalities, given the first two moments of the distribution, can be efficiently computed using convex optimization. This result generalizes Chebyshev’s inequality for univariate random variables. Two semidefinite programming formulations are presented, with a constructive proof based on convex optimization duality and elementary linear algebra. 
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 86 citations. REVIEW CITATIONS

1 Figure or Table

Topics

Statistics

01020'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

87 Citations

Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.