Stopping rules for a class of sampling-based stochastic programming algorithms
From MaRDI portal
Recommendations
- Stopping rules for optimization algorithms based on stochastic approximation
- scientific article; zbMATH DE number 3874334
- Fixed-width sequential stopping rules for a class of stochastic programs
- On the convergence of sampling algorithms for solving dynamic stochastic programming
- A stopping rule for stochastic approximation
- The empirical behavior of sampling methods for stochastic programming
- Stopping Rules for a Random Optimization Method
- A sequential sampling procedure for stochastic programming
- Randomized Optimal Stopping Algorithms and Their Convergence Analysis
- Dynamic sampling algorithms for multi-stage stochastic programs with risk aversion
Cited in
(9)- Assessing policy quality in a multistage stochastic program for long-term hydrothermal scheduling
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems
- Algorithms that satisfy a stopping criterion, probably
- Stopping rules for optimization algorithms based on stochastic approximation
- scientific article; zbMATH DE number 3874334 (Why is no real title available?)
- Importance sampling in stochastic programming: a Markov chain Monte Carlo approach
- Determining the optimal sample size in the Monte Carlo experiments
- Stochastic dual dynamic programming applied to nonconvex hydrothermal models
- Fixed-width sequential stopping rules for a class of stochastic programs
This page was built for publication: Stopping rules for a class of sampling-based stochastic programming algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2770101)
