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

DOI10.1145/1276927.1276932zbMath1390.90337OpenAlexW1965055282MaRDI QIDQ4565393

L. Jeff Hong, Barry L. Nelson

Publication date: 12 June 2018

Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1276927.1276932

zbMATH Keywords

random searchdiscrete stochastic optimization

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Numerical optimization and variational techniques (65K10) Search theory (90B40)

Related Items (3)

Speeding up COMPASS for high-dimensional discrete optimization via simulation ⋮ An Asymptotically Optimal Set Approach for Simulation Optimization ⋮ Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization

This page was built for publication: A framework for locally convergent random-search algorithms for discrete optimization via simulation