Distributionally robust optimization with polynomial densities: theory, models and algorithms
From MaRDI portal
Publication:2189441
Abstract: In distributionally robust optimization the probability distribution of the uncertain problem parameters is itself uncertain, and a fictitious adversary, e.g., nature, chooses the worst distribution from within a known ambiguity set. A common shortcoming of most existing distributionally robust optimization models is that their ambiguity sets contain pathological discrete distribution that give nature too much freedom to inflict damage. We thus introduce a new class of ambiguity sets that contain only distributions with sum-of-squares polynomial density functions of known degrees. We show that these ambiguity sets are highly expressive as they conveniently accommodate distributional information about higher-order moments, conditional probabilities, conditional moments or marginal distributions. Exploiting the theoretical properties of a measure-based hierarchy for polynomial optimization due to Lasserre [SIAM J. Optim. 21(3) (2011), pp. 864--885], we prove that certain worst-case expectation constraints are computationally tractable under these new ambiguity sets. We showcase the practical applicability of the proposed approach in the context of a stylized portfolio optimization problem and a risk aggregation problem of an insurance company.
Recommendations
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization. A review on theory and applications
- Distributionally robust possibilistic optimization problems
- A distributional interpretation of robust optimization
- Distributionally Robust Convex Optimization
- On the polynomial solvability of distributionally robust k-sum optimization
- Frameworks and results in distributionally robust optimization
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Distributionally Robust Linear and Discrete Optimization with Marginals
- Distributionally robust stochastic programming
Cites work
- scientific article; zbMATH DE number 995813 (Why is no real title available?)
- scientific article; zbMATH DE number 3130649 (Why is no real title available?)
- scientific article; zbMATH DE number 3163305 (Why is no real title available?)
- scientific article; zbMATH DE number 3257962 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Conic Programming Approach to Generalized Tchebycheff Inequalities
- A New Look at Nonnegativity on Closed Sets and Polynomial Optimization
- A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- A semidefinite programming approach to the generalized problem of moments
- Ambiguity in portfolio selection
- Ambiguous joint chance constraints under mean and dispersion information
- Ambiguous risk constraints with moment and unimodality information
- An adaptive numerical cubature algorithm for simplices
- Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing
- Constructing Risk Measures from Uncertainty Sets
- Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
- Convex Analysis
- Convex optimization theory.
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally Robust Convex Optimization
- Distributionally robust multi-item newsvendor problems with multimodal demand distributions
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Empirical properties of asset returns: stylized facts and statistical issues
- Generalized Gauss inequalities via semidefinite programming
- Geometric algorithms and combinatorial optimization
- Introduction to Stochastic Programming
- Invariant Integration Formulas for the n-Simplex by Combinatorial Methods
- Lectures on Stochastic Programming
- Linear programming under uncertainty
- Moments of non-negative mass
- On Bernstein and Markov-type inequalities for multivariate polynomials on convex bodies
- On duality theory of conic linear problems.
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach
- On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Quantitative risk management. Concepts, techniques and tools
- Robust optimization
- Robustness to dependency in portfolio optimization using overlapping marginals
- Slices, slabs, and sections of the unit hypercube
- Solving a class of multivariate integration problems via Laplace techniques
- The \(K\)-moment problem for continuous linear functionals
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
Cited in
(19)- Distributionally robust optimization with infinitely constrained ambiguity sets
- Models and algorithms for distributionally robust least squares problems
- Distributionally robust optimization with moment ambiguity sets
- Distributionally robust polynomial chance-constraints under mixture ambiguity sets
- On the polynomial solvability of distributionally robust k-sum optimization
- Minimizing rational functions: a hierarchy of approximations via pushforward measures
- A stochastic dual dynamic programming method for two-stage distributionally robust optimization problems
- Distributionally robust optimization with decision dependent ambiguity sets
- Robust portfolio optimization: a categorized bibliographic review
- A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
- Distributionally robust optimization with principal component analysis
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
- Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets
- Globalized distributionally robust optimization based on samples
- Quadrature-based polynomial optimization
- Special issue: On the interface between optimization and probability
- A distributionally robust optimization model for batch nonlinear switched time-delay system considering uncertain output measurements
- Risk-Averse Stochastic Programming: Time Consistency and Optimal Stopping
- Necessary optimality conditions for Lagrange problems involving ordinary control systems described by fractional Laplace operators
This page was built for publication: Distributionally robust optimization with polynomial densities: theory, models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2189441)
