University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Continuous Optimization Seminar - Ashkay RamachandranExport this event to calendar

Wednesday, March 21, 2018 — 4:00 PM EDT

Title: D. Bertsimas, I. Popescu - Optimal inequalities in probability theory: A convex optimization approach

Speaker: Ashkay Ramachandran
Affiliation: University of Waterloo
Room: MC 5479

Abstract: Abstract. We propose a semidefinite optimization approach to the problem of deriving tight moment inequalities for P(X ∈ S), for a set S defined by polynomial inequalities and a random vector X defined on Ω ⊆ Rn that has a given collection of up to kth-order moments. In the univariate case, we provide optimal bounds on P(X ∈ S), when the first k moments of X are given, as the solution of a semidefinite optimization problem in k + 1 dimensions. In the multivariate case, if the sets S and Ω are given by polynomial inequalities, we obtain an improving sequence of bounds by solving semidefinite optimization problems of polynomial size in n, for fixed k. We characterize the complexity of the problem of deriving tight moment inequalities. We show that it is NP-hard to find tight bounds for k ≥ 4 and Ω = Rn and for k ≥ 2 and Ω = Rn +, when the data in the problem is rational. For k = 1 and Ω = Rn + we show that we can find tight upper bounds by solving n convex optimization problems when the set S is convex, and we provide a polynomial time algorithm when S and Ω are unions of convex sets, over which linear functions can be optimized efficiently. For the case k = 2 and Ω = Rn, we present an efficient algorithm for finding tight bounds when S is a union of convex sets, over which convex quadratic functions can be optimized efficiently.

Location 
MC - Mathematics & Computer Building
5479
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
  1. 2020 (89)
    1. September (11)
    2. August (11)
    3. July (17)
    4. June (11)
    5. May (6)
    6. March (11)
    7. February (11)
    8. January (11)
  2. 2019 (167)
    1. December (5)
    2. November (15)
    3. October (18)
    4. September (15)
    5. August (9)
    6. July (17)
    7. June (18)
    8. May (16)
    9. April (9)
    10. March (24)
    11. February (13)
    12. January (8)
  3. 2018 (138)
  4. 2017 (103)
  5. 2016 (137)
  6. 2015 (136)
  7. 2014 (88)
  8. 2013 (48)
  9. 2012 (39)
  10. 2011 (36)
  11. 2010 (40)
  12. 2009 (40)
  13. 2008 (39)
  14. 2007 (15)