A critical note on empirical (Sample average, Monte Carlo) approximation of solutions to chance constrained programs
From MaRDI portal
Publication:4927261
Recommendations
- Sample average approximation method for chance constrained programming: Theory and applications
- scientific article; zbMATH DE number 4189474
- Scenario approximations of chance constraints
- On safe tractable approximations of chance constraints
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
Cited in
(11)- Sample average approximation method for chance constrained programming: Theory and applications
- Data-driven tuning for chance constrained optimization: analysis and extensions
- Proximal bundle methods for nonsmooth DC programming
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- Optimization under rare chance constraints
- Solving chance-constrained problems via a smooth sample-based nonlinear approximation
- Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs
- A sample average approximation approach for log-sigmoid approximation of chance constrained problem
- scientific article; zbMATH DE number 4189474 (Why is no real title available?)
- An empirical quantile estimation approach for chance-constrained nonlinear optimization problems
- Solving joint chance constrained problems using regularization and Benders' decomposition
This page was built for publication: A critical note on empirical (Sample average, Monte Carlo) approximation of solutions to chance constrained programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4927261)