- Seminar Calendar
- Seminar Archive
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
Seminar: Discrete Convex Simulation Optimization
----------------------------------------------------------------------------------------------------
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
----------------------------------------------------------------------------------------------------
Date: Friday, March 12, 2021, 10:00 to 11:00
Title: Discrete Convex Simulation Optimization
Speaker: Professor Zeyu Zheng, University of California Berkeley
Abstract:
We propose new sequential simulation algorithms for general convex simulation optimization problems with high-dimensional discrete decision space. The performance of each discrete decision variable is evaluated via stochastic simulation replications. Our proposed simulation algorithms utilize the discrete convex structure and are guaranteed with high probability to find a solution that is close to the best within any given user-specified precision level. The proposed algorithms work for any general convex problem and the efficiency is demonstrated by proved upper bounds on simulation costs. The upper bounds demonstrate a moderate order of polynomial dependence on the dimension and scale of the decision space. For some discrete simulation optimization problems, a gradient estimator may be available at low costs along with a single simulation replication. By integrating gradient estimators, which are possibly biased, we propose simulation algorithms to achieve optimality guarantees with a reduced dependence on the dimension under moderate assumptions on the bias.
Biography:
Zeyu Zheng is an Assistant Professor at the University of California Berkeley, Department of Industrial Engineering and Operations Research. He received his PhD in Operations Research, PhD minor in Statistics, and MA in Economics from Stanford University, and BS in Mathematics from Peking University. His research interest is in simulation, non-stationary stochastic modeling and decision making, and financial technologies.
Date:
Friday, March 12, 2021 - 10:00 to 11:00