Adaptive Polar Sampling is proposed as an algorithm where random drawings aredirectly generated from the target function (posterior) in all-but-onedirections of the parameter space. The method is based on the mixed integrationtechnique of Van Dijk, Kloek & Boender (1985) but extends this one by...

We discuss in this paper statistical inference of sample average approximations of multistage stochastic programming problems. We show that any random sampling scheme provides a valid statistical lower bound for the optimal (minimum) value of the true problem. However, in order for such lower...

We discuss in this paper statistical inference of sample average approximations of multistage stochastic programming problems. We show that any random sampling scheme provides a valid statistical lower bound for the optimal (minimum) value of the true problem. However, in order for such lower...

Adaptive Polar Sampling is proposed as an algorithm where random drawings are directly generated from the target function (posterior) in all-but-one directions of the parameter space. The method is based on the mixed integration technique of Van Dijk, Kloek & Boender (1985) but extends this one...