Optimization Online


Generalized Gauss Inequalities via Semidefinite Programming

Bart P.G. Van Parys (bartvan***at***control.ee.ethz.ch)
Paul J. Goulart (pgoulart***at***control.ee.ethz.ch)
Daniel Kuhn (daniel.kuhn***at***epfl.ch)

Abstract: 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 determined by a discrete worst-case distribution. In this paper we obtain a less pessimistic Gauss-type bound by imposing the additional requirement that the random vector's distribution must be unimodal. We prove that this generalized Gauss bound still admits an exact and tractable semidefinite representation. Moreover, we demonstrate that both the Chebyshev and Gauss bounds can be obtained within a unified framework using a generalized notion of unimodality. We also offer new perspectives on the computational solution of generalized moment problems, since we use concepts from Choquet theory instead of traditional duality arguments to derive semidefinite representations for worst-case probability bounds.

Keywords: Convex optimization, probability inequalities, unimodality

Category 1: Convex and Nonsmooth Optimization (Convex Optimization )

Category 2: Stochastic Programming

Category 3: Applications -- Science and Engineering (Statistics )


Download: [PDF]

Entry Submitted: 01/01/2014
Entry Accepted: 01/01/2014
Entry Last Modified: 11/24/2014

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society