Technical note: improved sample-complexity bounds in stochastic optimization
| Alternative title: | Improved sample-complexity bounds in stochastic optimization |
|---|---|
| Year of publication: |
2025
|
| Authors: | Baveja, Alok ; Chavan, Amit ; Nikiforov, Andrei ; Srinivasan, Aravind ; Xu, Pan |
| Published in: |
Operations research. - Linthicum, Md. : INFORMS, ISSN 1526-5463, ZDB-ID 2019440-7. - Vol. 73.2025, 2, p. 986-994
|
| Subject: | Optimization | stochastic optimization | sample complexity | sample-average approximation | Theorie | Theory | Stochastischer Prozess | Stochastic process | Mathematische Optimierung | Mathematical programming | Stichprobenerhebung | Sampling | Dynamische Optimierung | Dynamic programming |
-
Data-driven minimax optimization with expectation constraints
Yang, Shuoguang, (2025)
-
On the convergence of decomposition methods for multistage stochastic convex programs
Girardeau, P., (2015)
-
A note on appointment scheduling with piecewise linear cost functions
Ge, Dongdong, (2014)
- More ...
-
Liu, Jun, (2019)
-
An optimization approach to gene stacking
Xu, Pan, (2011)
-
Xu, Pan, (2014)
- More ...