Generalized Chebyshev Bounds via Semidefinite Programming
- 1 January 2007
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 49 (1), 52-64
- https://doi.org/10.1137/s0036144504440543
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Worst-case large-deviation asymptotics with application to queueing and information theoryStochastic Processes and their Applications, 2006
- Optimal Inequalities in Probability Theory: A Convex Optimization ApproachSIAM Journal on Optimization, 2005
- Semidefinite programming relaxations for semialgebraic problemsMathematical Programming, 2003
- Optimization Problems over Positive Pseudopolynomial MatricesSIAM Journal on Matrix Analysis and Applications, 2003
- Bounds on measures satisfying moment conditionsThe Annals of Applied Probability, 2002
- On Nesterov's Approach to Semi-infinite ProgrammingActa Applicandae Mathematicae, 2002
- Inequalities of the types of chebyshev and cramér-rao and mathematical programmingAnnals of the Institute of Statistical Mathematics, 1964
- On sharpness of tchebycheff-type inequalitiesAnnals of the Institute of Statistical Mathematics, 1962
- Multivariate Chebyshev InequalitiesThe Annals of Mathematical Statistics, 1960
- On a method for generalizations of tchebycheff’s inequalityAnnals of the Institute of Statistical Mathematics, 1959