Conference Rebounding Bandits for Modeling Satiation Effects 2021 • Advances in Neural Information Processing Systems • 34: Liu L, Kilinc-Karzan F, Lipton ZC, Montgomery AL
Conference Rebounding Bandits for Modeling Satiation Effects. 2021 • NeurIPS • 4003-4014 Leqi L, Kilinç-Karzan F, Lipton ZC, Montgomery AL
Journal Article Technical Note-Dynamic Data-Driven Estimation of Nonparametric Choice Models 2021 • Operations Research • 69(4):1228-1239 Nam H-N, Kilinc-Karzan F
Preprint A Geometric View of SDP Exactness in QCQPs and its Applications 2020 Wang AL, Kilinc-Karzan F
Preprint Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications 2020 Kılınç-Karzan F, Küçükyavuz S, Lee D, Shafieezadeh-Abadeh S
Preprint Distributionally Robust Chance-Constrained Programs with Right-Hand Side Uncertainty under Wasserstein Ambiguity 2020 Ho-Nguyen N, Kılınç-Karzan F, Küçükyavuz S, Lee D
Journal Article Faster algorithms for extensive-form game solving via improved smoothing functions 2020 • Mathematical programming • 179(1-2):385-417 Kroer C, Waugh K, Kilinc-Karzan F, Sandholm T
Preprint Necessary and sufficient conditions for rank-one generated cones 2020 Argue CJ, Kılınç-Karzan F, Wang AL
Conference On Convex Hulls of Epigraphs of QCQPs 2020 • Lecture Notes in Computer Science • 12125:419-432 Wang AL, Kilinc-Karzan F
Preprint Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences 2020 Chen VX, Kılınç-Karzan F
Journal Article Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences. 2020 • CoRR • abs/2008.10460: Chen VX, Kilinç-Karzan F
Preprint Rebounding Bandits for Modeling Satiation Effects 2020 Leqi L, Kilinc-Karzan F, Lipton ZC, Montgomery AL
Preprint Risk Guarantees for End-to-End Prediction and Optimization Processes 2020 Ho-Nguyen N, Kılınç-Karzan F
Preprint Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty under Wasserstein Ambiguity 2020 Ho-Nguyen N, Kılınç-Karzan F, Küçükyavuz S, Lee D
Journal Article Exploiting problem structure in optimization under uncertainty via online convex optimization 2019 • Mathematical programming • 177(1-2):113-147 Nam H-N, Kilinc-Karzan F
Preprint Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens 2019 Kılınç-Karzan F, Küçükyavuz S, Lee D
Journal Article On intersection of two mixing sets with applications to joint chance-constrained programs 2019 • Mathematical programming • 175(1-2):29-68 Liu X, Kilinc-Karzan F, Kucukyavuz S
Preprint The Generalized Trust Region Subproblem: solution complexity and convex hull results 2019 Wang AL, Kilinc-Karzan F
Journal Article Online First-Order Framework for Robust Convex Optimization 2018 • Operations Research • 66(6):1670-1692 Ho-Nguyen N, Kilinc-Karzan F
Journal Article Primal-Dual Algorithms for Convex Optimization via Regret Minimization 2018 • IEEE Control Systems Letters • 2(2):284-289 Nam H-N, Kilinc-Karzan F
Journal Article A SECOND-ORDER CONE BASED APPROACH FOR SOLVING THE TRUST-REGION SUBPROBLEM AND ITS VARIANTS 2017 • SIAM Journal on Optimization • 27(3):1485-1512 Nam H-N, Kilinc-Karzan F
Preprint Dynamic Data-Driven Estimation of Non-Parametric Choice Models 2017 Ho-Nguyen N, Kilinc-Karzan F
Preprint Dynamic Data-Driven Estimation of Non-Parametric Choice Models 2017 Ho-Nguyen N, Kilinc-Karzan F
