Convex optimal uncertainty quantification
From MaRDI portal
Abstract: Optimal uncertainty quantification (OUQ) is a framework for numerical extreme-case analysis of stochastic systems with imperfect knowledge of the underlying probability distribution. This paper presents sufficient conditions under which an OUQ problem can be reformulated as a finite-dimensional convex optimization problem, for which efficient numerical solutions can be obtained. The sufficient conditions include that the objective function is piecewise concave and the constraints are piecewise convex. In particular, we show that piecewise concave objective functions may appear in applications where the objective is defined by the optimal value of a parameterized linear program.
Recommendations
Cites work
- A Semidefinite Programming Approach to Optimal-Moment Bounds for Convex Classes of Distributions
- Bounds on measures satisfying moment conditions.
- Brittleness of Bayesian inference and new Selberg formulas
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Generalized Chebychev Inequalities: Theory and Applications in Decision Analysis
- Generalized Chebyshev Bounds via Semidefinite Programming
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 2012405 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3246461 (Why is no real title available?)
- scientific article; zbMATH DE number 3191506 (Why is no real title available?)
- Inequalities of the type of Chebyshev and Cramer-Rao and mathematical programming
- Models and algorithms for distributionally robust least squares problems
- Models for minimax stochastic linear optimization problems with risk aversion
- Moments of non-negative mass
- Multivariate Chebyshev Inequalities
- On a method for generalizations of Chebyshev's inequality
- On duality theory of conic linear problems.
- On sharpness of Tchebycheff-type inequalities
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Optimal uncertainty quantification
- Probability and random processes.
Cited in
(14)- Probability estimation via policy restrictions, convexification, and approximate sampling
- Tight tail probability bounds for distribution-free decision making
- Optimal uncertainty quantification
- scientific article; zbMATH DE number 1150215 (Why is no real title available?)
- Ambiguous joint chance constraints under mean and dispersion information
- MAD dispersion measure makes extremal queue analysis simple
- Optimal uncertainty quantification for legacy data observations of Lipschitz functions
- Convexifiable quadratic inequality systems: new minimax S-lemma and exact SOCPs for classes of distributionally robust optimization problems
- Distributionally robust optimization
- Piecewise SOS-convex moment optimization and applications via exact semi-definite programs
- Distributionally robust optimal uncertainty quantification under Phi-divergence ambiguity
- Optimal unpredictable control for linear systems
- Convergent lifted Lasserre hierarchy of SDPs for minimizing expectation of piecewise polynomial loss over Wasserstein balls
- Piecewise sum-of-squares convexity and Wasserstein distributionally robust optimization: exact semi-definite programming reformulations with data-driven decision-making under uncertainty
This page was built for publication: Convex optimal uncertainty quantification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501231)
