Stopping rules for a random optimization method
SIAM Journal on Control and Optimization
Asymptotic analysis of stochastic programs
Annals of Operations Research
Stochastic discrete optimization
SIAM Journal on Control and Optimization
Asymptotic behavior of optimal solutions in stochastic programming
Mathematics of Operations Research
Alternative sampling strategy for a random optimization algorithm
Journal of Optimization Theory and Applications
A method for discrete stochastic optimization
Management Science
Analysis of sample-path optimization
Mathematics of Operations Research
Convergence analysis of stochastic algorithms
Mathematics of Operations Research
On a stochastic knapsack problem and generalizations
Advances in computational and stochastic optimization, logic programming, and heuristic search
A simulation-based approach to two-stage stochastic programming with recourse
Mathematical Programming: Series A and B
A branch and bound method for stochastic global optimization
Mathematical Programming: Series A and B
Finding Optimal Material Release Times Using Simulation-Based Optimization
Management Science
The Sample Average Approximation Method for Stochastic Discrete Optimization
SIAM Journal on Optimization
On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
SIAM Journal on Optimization
SIAM Journal on Optimization
Accounting for Randomness in Heuristic Simulation Optimization
Proceedings of the 12th European Simulation Multiconference on Simulation - Past, Present and Future
Global Stochastic Optimization with Low-Dispersion Point Sets
Operations Research
CONVERGENCE OF SIMULATION-BASED POLICY ITERATION
Probability in the Engineering and Informational Sciences
Simulation optimization with countably infinite feasible regions: Efficiency and convergence
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On choosing parameters in retrospective-approximation algorithms for simulation-optimization
Proceedings of the 38th conference on Winter simulation
Sequential sampling for solving stochastic programs
Proceedings of the 39th conference on Winter simulation: 40 years! The best is yet to come
Retrospective-approximation algorithms for the multidimensional stochastic root-finding problem
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Balanced Explorative and Exploitative Search with Estimation for Simulation Optimization
INFORMS Journal on Computing
A survey on metaheuristics for stochastic combinatorial optimization
Natural Computing: an international journal
Automatica (Journal of IFAC)
The stochastic root-finding problem: Overview, solutions, and open questions
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A Price Based Decentralized Rate Selection in IEEE 802.11 Based WLANS
Wireless Personal Communications: An International Journal
A Sequential Sampling Procedure for Stochastic Programming
Operations Research
Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
Computational Optimization and Applications
Dynamic facility location with stochastic demands
SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications
A VNS algorithm for noisy problems and its application to project portfolio analysis
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
An introspective on the retrospective-approximation paradigm
Proceedings of the Winter Simulation Conference
Convergence properties of direct search methods for stochastic optimization
Proceedings of the Winter Simulation Conference
Line search methods with variable sample size for unconstrained optimization
Journal of Computational and Applied Mathematics
On sample size control in sample average approximations for solving smooth stochastic programs
Computational Optimization and Applications
| Hi-index | 0.00 |
In this article we discuss the application of a certain class of Monte Carlo methods to stochastic optimization problems. Particularly, we study variable-sample techniques, in which the objective function is replaced, at each iteration, by a sample average approximation. We first provide general results on the schedule of sample sizes, under which variable-sample methods yield consistent estimators as well as bounds on the estimation error. Because the convergence analysis is performed pathwisely, we are able to obtain our results in a flexible setting, which requires mild assumptions on the distributions and which includes the possibility of using different sampling distributions along the algorithm. We illustrate these ideas by studying a modification of the well-known pure random search method, adapting it to the variable-sample scheme, and show conditions for convergence of the algorithm. Implementation issues are discussed and numerical results are presented to illustrate the ideas.