Generalized Gauss inequalities via semidefinite programming

A sharp upper bound on the probability of a random vector falling outside a polytope, based solely on the first and second moments of its distribution, can be computed efficiently using semidefinite programming. However, this Chebyshev-type bound tends to be overly conservative since it is determine...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 156; číslo 1-2; s. 271 - 302
Hlavní autoři:	Van Parys, Bart P. G., Goulart, Paul J., Kuhn, Daniel
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2016 Springer Nature B.V
Témata:	Calculus of Variations and Optimal Control; Optimization Chebyshev approximation Combinatorics Computation Computer programming Decision theory Falling Full Length Paper Inequalities Inequality Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Probability Random variables Representations Studies Theoretical Vectors (mathematics) United States > US 90C15 Stochastic programming 90C22 Semidefinite programming
ISSN:	0025-5610, 1436-4646
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!