A framework for locally convergent random-search algorithms for discrete optimization via simulation

  • Authors:
  • L. Jeff Hong;Barry L. Nelson

  • Affiliations:
  • The Hong Kong University of Science and Technology, Hong Kong, China;Northwestern University, Evanston, IL

  • Venue:
  • ACM Transactions on Modeling and Computer Simulation (TOMACS)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of this article is to provide a general framework for locally convergent random-search algorithms for stochastic optimization problems when the objective function is embedded in a stochastic simulation and the decision variables are integer ordered. The framework guarantees desirable asymptotic properties, including almost-sure convergence and known rate of convergence, for any algorithms that conform to its mild conditions. Within this framework, algorithm designers can incorporate sophisticated search schemes and complicated statistical procedures to design new algorithms.