Probabilistic Guarantees in Robust Optimization
From MaRDI portal
Publication:5013583
DOI10.1137/21M1390967zbMath1481.90238WikidataQ120689956 ScholiaQ120689956MaRDI QIDQ5013583
Jean Pauphilet, Dick den Hertog, Dimitris J. Bertsimas
Publication date: 1 December 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Robustness in mathematical programming (90C17)
Related Items
Data-driven robust optimization using deep neural networks ⋮ Robust convex optimization: a new perspective that unifies and extends
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust linear optimization under general norms.
- An exact algorithm for the capacitated facility location problems with single sourcing
- Robust solutions of linear programming problems contaminated with uncertain data
- Data-driven robust optimization
- Uncertain convex programs: randomized solutions and confidence levels
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally robust joint chance constraints with second-order moment information
- On distributionally robust chance constrained programs with Wasserstein distance
- Recent advances in robust optimization: an overview
- A distributionally robust perspective on uncertainty quantification and chance constrained programming
- Worst-case violation of sampled convex programs for optimization with uncertainty
- Tractable approximations to robust conic optimization problems
- Ambiguous chance constrained problems and robust optimization
- Deriving robust counterparts of nonlinear uncertain inequalities
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Distributionally Robust Optimization and Its Tractable Approximations
- Percentile Optimization for Markov Decision Processes with Parameter Uncertainty
- From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
- Theory and Applications of Robust Optimization
- The Exact Feasibility of Randomized Solutions of Uncertain Convex Programs
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- The Price of Robustness
- Ambiguous Joint Chance Constraints Under Mean and Dispersion Information
- High-Dimensional Statistics
- Optimization Under Probabilistic Envelope Constraints
- Rates of convergence for random approximations of convex sets
- Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection
- The Scenario Approach to Robust Control Design
- Multivariate Chebyshev Inequalities
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- Distributionally robust chance constraints for non-linear uncertainties
