Model-based annealing random search with stochastic averaging
From MaRDI portal
Recommendations
- On the implementation of a class of stochastic search algorithms
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization
- A Survey of Some Model-Based Methods for Global Optimization
- Dynamic sample budget allocation in model-based optimization
- Parallel MCMC methods for global optimization
Cites work
- A deterministic analysis of stochastic approximation with randomized directions
- A Model Reference Adaptive Search Method for Global Optimization
- Annealing adaptive search, cross-entropy, and stochastic approximation in global optimization
- Approximate stochastic annealing for online control of infinite horizon Markov decision processes
- Feature Article—Statistical Analysis of Simulation Output Data
- Gradient-Based Adaptive Stochastic Search for Non-Differentiable Optimization
- scientific article; zbMATH DE number 1702339 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 2117227 (Why is no real title available?)
- Introduction to evolutionary computing
- Introduction to Stochastic Search and Optimization
- Model-based search for combinatorial optimization: A critical survey
- Nested Partitions Method for Global Optimization
- On the almost sure convergence of a general stochastic approximation procedure
- Optimization by simulated annealing
- Stochastic adaptive search for global optimization.
Cited in
(9)- Stochastic annealing for synthesis under uncertainty
- Empirical tail risk management with model-based annealing random search
- On the implementation of a class of stochastic search algorithms
- Classical Model Selection via Simulated Annealing
- Optimization of Jacobian matrix annealing algorithm based on hybrid model
- Actor-Critic–Like Stochastic Adaptive Search for Continuous Simulation Optimization
- Single Observation Adaptive Search for Continuous Simulation Optimization
- Dynamic sample budget allocation in model-based optimization
- Numerical methods for distributed stochastic compositional optimization problems with aggregative structure
This page was built for publication: Model-based annealing random search with stochastic averaging
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5270721)