Accelerating the convergence of random search methods for discrete stochastic optimization
From MaRDI portal
Publication:4575347
DOI10.1145/352222.352225zbMath1391.65019OpenAlexW2125969801MaRDI QIDQ4575347
Publication date: 13 July 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/352222.352225
convergence ratediscrete stochastic optimizationaccelerated convergencerandom search methodsestimating the optimal solution
Probabilistic models, generic numerical methods in probability and statistics (65C20) Numerical optimization and variational techniques (65K10) Search theory (90B40)
Related Items (8)
Retrospective optimization of mixed-integer stochastic systems using dynamic simplex linear interpolation ⋮ An Asymptotically Optimal Set Approach for Simulation Optimization ⋮ Multi-objective simulation-based evolutionary algorithm for an aircraft spare parts allocation problem ⋮ A sequential procedure for neighborhood selection-of-the-best in optimization via simulation ⋮ Discrete stochastic optimization using variants of the stochastic ruler method ⋮ A modified Hooke and Jeeves algorithm with likelihood ratio performance extrapolation for simulation optimization ⋮ Penalty Function with Memory for Discrete Optimization via Simulation with Stochastic Constraints ⋮ Pattern search ranking and selection algorithms for mixed variable simulation-based optimization
This page was built for publication: Accelerating the convergence of random search methods for discrete stochastic optimization
