- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- Distributionally Robust Optimization with SOS Polynomial...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
Distributionally Robust Optimization with SOS Polynomial Density Functions and Moment Conditions Postek, Krzysztof
Description
Numerous decision problems are solved using the tools of distributionally robust optimization. In this framework, the distribution of the problem's random parameter is assumed to be known only partially in the form of, for example, the values of its first moments. The aim is to minimize the expected value of a function of the decision variables, assuming the worst-possible realization of the unknown probability measure. In the general moment problem approach, the worst-case distributions are atomic. We propose to model smooth uncertain density functions using sum-of-squares polynomials with known moments over a given domain. We show that in this setup, one can evaluate the worst-case expected values of the functions of the decision variables in a computationally tractable way. Joint work with Etienne de Klerk and Daniel Kuhn.
Item Metadata
Title |
Distributionally Robust Optimization with SOS Polynomial Density Functions and Moment Conditions
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2018-03-05T11:18
|
Description |
Numerous decision problems are solved using the tools of distributionally robust optimization. In this framework, the distribution of the problem's random parameter is assumed to be known only partially in the form of, for example, the values of its first moments. The aim is to minimize the expected value of a function of the decision variables, assuming the worst-possible realization of the unknown probability measure. In the general moment problem approach, the worst-case distributions are atomic. We propose to model smooth uncertain density functions using sum-of-squares polynomials with known moments over a given domain. We show that in this setup, one can evaluate the worst-case expected values of the functions of the decision variables in a computationally tractable way.
Joint work with Etienne de Klerk and Daniel Kuhn.
|
Extent |
34 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Erasmus University Rotterdam
|
Series | |
Date Available |
2018-09-02
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0371879
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Researcher
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International