Balancing exploitation and exploration in discrete optimization via simulation through a Gaussian process-based search
From MaRDI portal
Publication:2941434
Recommendations
- Information Relaxations, Duality, and Convex Stochastic Dynamic Programs
- Information relaxation bounds for infinite horizon Markov decision processes
- Approximations to stochastic dynamic programs via information relaxation duality
- Information relaxations and duality in stochastic dynamic programs
- Relaxations of Weakly Coupled Stochastic Dynamic Programs
Cited in
(10)- Adaptive sampling line search for local stochastic optimization with integer variables
- Approximations to stochastic dynamic programs via information relaxation duality
- Combined Global and Local Search for Optimization with Gaussian Process Models
- Generalized integrated Brownian fields for simulation metamodeling
- Comparison of Kriging-based algorithms for simulation optimization with heterogeneous noise
- scientific article; zbMATH DE number 6433488 (Why is no real title available?)
- Projected Gaussian Markov improvement algorithm for high-dimensional discrete optimization via simulation
- Information relaxation bounds for infinite horizon Markov decision processes
- Faster Kriging: facing high-dimensional simulators
- Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields
This page was built for publication: Balancing exploitation and exploration in discrete optimization via simulation through a Gaussian process-based search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941434)
