Stochastic localization methods for convex discrete optimization via simulation
| Year of publication: |
2025
|
|---|---|
| Authors: | Zhang, Haixiang ; Zheng, Zeyu ; Lavaei, Javad |
| Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 73.2025, 2, p. 927-948
|
| Subject: | Simulation | convex optimization | best achievable performance | dimension reduction method | discrete optimization via simulation | shrinking uniform sampling algorithm | stochastic cutting-plane methods | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Stochastischer Prozess | Stochastic process | Stichprobenerhebung | Sampling | Monte-Carlo-Simulation | Monte Carlo simulation |
-
Importance sampling in stochastic optimization : an application to intertemporal portfolio choice
Ekblom, J., (2020)
-
Importance sampling in stochastic programming : a Markov chain Monte Carlo approach
Parpas, Panos, (2015)
-
A sample average approximation method for disassemblx line balancing problem under uncertainty
Bentaha, Mohand Lounes, (2014)
- More ...
-
Gradient-based algorithms for convex discrete optimization via simulation
Zhang, Haixiang, (2023)
-
Inference on the best policies with many covariates
Wei, Waverly, (2024)
-
Learning newsvendor problems with intertemporal dependence and moderate non-stationarities
Qi, Meng, (2024)
- More ...