Model-Based Annealing Random Search with Stochastic Averaging
From MaRDI portal
Publication:5270721
DOI10.1145/2641565zbMath1369.90135OpenAlexW2131846131MaRDI QIDQ5270721
Publication date: 30 June 2017
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2641565
Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59) Stochastic approximation (62L20)
Related Items (3)
Actor-Critic–Like Stochastic Adaptive Search for Continuous Simulation Optimization ⋮ Empirical tail risk management with model-based annealing random search ⋮ Single Observation Adaptive Search for Continuous Simulation Optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Model-based search for combinatorial optimization: A critical survey
- Stochastic adaptive search for global optimization.
- Approximate stochastic annealing for online control of infinite horizon Markov decision processes
- Gradient-Based Adaptive Stochastic Search for Non-Differentiable Optimization
- Feature Article—Statistical Analysis of Simulation Output Data
- A Model Reference Adaptive Search Method for Global Optimization
- On the almost sure convergence of a general stochastic approximation procedure
- Introduction to Stochastic Search and Optimization
- A deterministic analysis of stochastic approximation with randomized directions
- Nested Partitions Method for Global Optimization
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization
- Introduction to evolutionary computing
This page was built for publication: Model-Based Annealing Random Search with Stochastic Averaging