Complex chance-constrained optimization under Wasserstein ball
From MaRDI portal
Cites work
- A proximal difference-of-convex algorithm for sample average approximation of chance constrained programming
- A second-order cone programming approach for linear programs with joint probabilistic constraints
- An introduction to copulas.
- Chance-constrained programming
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Dependence modeling with copulas
- Distributionally robust chance-constrained Markov decision processes with random payoff
- Distributionally Robust Stochastic Optimization with Wasserstein Distance
- scientific article; zbMATH DE number 3613366 (Why is no real title available?)
- Linear programming in complex space
- Nonlinear programming in complex space: Sufficient conditions and duality
- On distributionally robust chance constrained programs with Wasserstein distance
- On distributionally robust chance-constrained linear programs
- Proceedings of the Princeton Symposium on Mathematical Programming
- Robust Beamforming via Worst-Case SINR Maximization
This page was built for publication: Complex chance-constrained optimization under Wasserstein ball
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7347074)