Solving a class of convex stochastic programs via Monte Carlo simulation
From MaRDI portal
Recommendations
- On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs
- Monte Carlo sampling approach to stochastic programming
- Monte Carlo methods for mean-risk optimization and portfolio selection
- Nonlinear stochastic programming by Monte-Carlo estimators
- Application of the Monte-Carlo method to stochastic linear programming
Cited in
(13)- Monte Carlo (importance) sampling within a Benders decomposition algorithm for stochastic linear programs
- On Monte-Carlo methods in convex stochastic optimization
- On the rate of convergence of optimal solutions of Monte Carlo approximations of stochastic programs
- Risk management in portfolio applications of non-convex stochastic programming
- Monte Carlo methods for mean-risk optimization and portfolio selection
- Monte Carlo sampling approach to stochastic programming
- scientific article; zbMATH DE number 2114218 (Why is no real title available?)
- Randomized Algorithms for Semi-Infinite Programming Problems
- Solving Stochastic Dynamic Programs by Convex Optimization and Simulation
- Solving Stochastic Mathematical Programs with Complementarity Constraints Using Simulation
- Consistency of Monte Carlo estimators for risk-neutral PDE-constrained optimization
- Monte Carlo within simulated annealing for integral constrained optimizations
- Monte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints
This page was built for publication: Solving a class of convex stochastic programs via Monte Carlo simulation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3572618)
