Gradient-Based Algorithms for Convex Discrete Optimization via Simulation: Truncated Stochastic Subgradient Descent with Rounding Finds an (ε, δ)-Good Solution of Stochastic Submodular MinimizationResearch Paper
Many operations decisions are made over discrete, high-dimensional choices whose cost can only be estimated by simulation: how many bikes to place at each station, which subset of facilities to open, how to allocate servers in a queueing network. Each evaluation of a candidate decision is a noisy run of a simulator, and the goal is to select a decision…