Distributionally robust optimization with infinitely constrained ambiguity sets
From MaRDI portal
Recommendations
- Distributionally robust optimization with polynomial densities: theory, models and algorithms
- Distributionally robust optimization with moment ambiguity sets
- Distributionally Robust Convex Optimization
- Distributionally robust optimization with decision dependent ambiguity sets
- Partition-based distributionally robust optimization via optimal transport with order cone constraints
Cites work
- scientific article; zbMATH DE number 5321684 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 753805 (Why is no real title available?)
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- A Robust Optimization Perspective on Stochastic Programming
- A comment on ``Computational complexity of stochastic programming problems
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Algorithms for the solution of stochastic dynamic minimax problems
- Ambiguity in portfolio selection
- Ambiguous joint chance constraints under mean and dispersion information
- Bounding probability of small deviation: a fourth moment approach
- Convex Approximations of Chance Constrained Programs
- Data-driven chance constrained stochastic program
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Distributionally Robust Convex Optimization
- Distributionally robust joint chance constraints with second-order moment information
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- From CVaR to uncertainty set: implications in joint chance-constrained optimization
- Global optimization with polynomials and the problem of moments
- Goal-driven optimization
- Graph implementations for nonsmooth convex programs
- Introduction to stochastic programming.
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Likelihood robust optimization for data-driven problems
- Maxmin expected utility with non-unique prior
- Minimax analysis of stochastic problems
- On duality theory of conic linear problems.
- On general minimax theorems
- On sharpness of Tchebycheff-type inequalities
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Optimization with Stochastic Dominance Constraints
- PRICING A CLASS OF EXOTIC OPTIONS VIA MOMENTS AND SDP RELAXATIONS
- Robust Solutions to Uncertain Semidefinite Programs
- Robust convex optimization
- Robust optimization made easy with ROME
- Robust optimization with ambiguous stochastic constraints under mean and dispersion information
- Semidefinite programming relaxations for semialgebraic problems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- The Price of Robustness
- The minimax approach to stochastic programming and an illustrative application
- Theory of games and economic behavior.
- Trust Region Methods
- Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach
Cited in
(22)- A study of data-driven distributionally robust optimization with incomplete joint data under finite support
- Robust integrated planning for LEO satellite network design and service operations
- Distortion risk measure under parametric ambiguity
- Distributional utility preference robust optimization models in multi-attribute decision making
- Distributionally robust optimization
- Distributionally robust optimization with moment ambiguity sets
- An Approximation Scheme for Distributionally Robust Nonlinear Optimization
- Distributionally robust disaster relief planning under the Wasserstein set
- Distributionally Robust Stochastic Dual Dynamic Programming
- Globalized distributionally robust optimization problems under the moment-based framework
- Robust optimization with ambiguous stochastic constraints under mean and dispersion information
- Distributionally robust optimization with decision dependent ambiguity sets
- Distributionally robust discrete optimization with entropic Value-at-Risk
- The Discrete Moment Problem with Nonconvex Shape Constraints
- Relaxation schemes for the joint linear chance constraint based on probability inequalities
- Partition-based distributionally robust optimization via optimal transport with order cone constraints
- Inseparable robust reward-risk optimization models with distribution uncertainty
- Exact solving approach to moment problems with nonnegative Chebyshev ambiguity sets
- Sharing the value‐at‐risk under distributional ambiguity
- An approximation scheme for distributionally robust PDE-constrained optimization
- Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness
- Frameworks and results in distributionally robust optimization
This page was built for publication: Distributionally robust optimization with infinitely constrained ambiguity sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5129197)
