Technical note -- Improved sample-complexity bounds in stochastic optimization

DOI10.1287/OPRE.2018.0340MaRDI QIDQ6974737zbMATH OpenFDO

Authors Alok Baveja, Amit Chavan, Andrei Nikiforov, Aravind Srinivasan, Pan Xu

Publication date 5 June 2025

Published in Operations Research (Search for Journal in Brave)

zbMATH Keywords

stochastic optimizationsample complexitysample-average approximation

Mathematics Subject Classification ID

Stochastic programming (90C15)

This page was built for publication: Technical note -- Improved sample-complexity bounds in stochastic optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974737)