Efficient data-driven optimization with noisy data
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 435515 (Why is no real title available?)
- scientific article; zbMATH DE number 107551 (Why is no real title available?)
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- A robust learning approach for regression models based on distributionally robust optimization
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Data-driven robust optimization
- Distributionally Robust Convex Optimization
- Distributionally robust optimization and its tractable approximations
- Distributionally robust optimization under moment uncertainty with application to data-driven problems
- Generalized Gauss inequalities via semidefinite programming
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Recovering best statistical guarantees via the empirical divergence-based distributionally robust optimization
- Regularization via mass transportation
- Robust Wasserstein profile inference and applications to machine learning
- Robust empirical optimization is almost the same as mean-variance optimization
- Set-valued analysis
- Statistics of robust optimization: a generalized empirical likelihood approach
- The Existence of Probability Measures with Given Marginals
This page was built for publication: Efficient data-driven optimization with noisy data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988668)
