Fatma Kilinç-Karzan

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 33

Top Topics

Chance Constrained

Convex Optimization

Top Venues

Publications

Lingqing Shen, Nam Ho-Nguyen, Khanh-Hung Giang-Tran, Fatma Kilinç-Karzan
Mistake, Manipulation and Margin Guarantees in Online Strategic Classification. CoRR (2024)
Alex L. Wang, Fatma Kilinç-Karzan
On semidefinite descriptions for convex hulls of quadratic programs. Oper. Res. Lett. 54 (2024)
Soroosh Shafieezadeh-Abadeh, Fatma Kilinç-Karzan
Constrained Optimization of Rank-One Functions with Indicator Variables. CoRR (2023)
Lingqing Shen, Nam Ho-Nguyen, Fatma Kilinç-Karzan
An online convex optimization-based framework for convex bilevel optimization. Math. Program. 198 (2) (2023)
Liu Leqi, Giulio Zhou, Fatma Kilinç-Karzan, Zachary C. Lipton, Alan L. Montgomery
A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits. CHI (2023)
Alex L. Wang, Yunlei Lu, Fatma Kilinç-Karzan
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem. SIAM J. Optim. 33 (2) (2023)
Liu Leqi, Giulio Zhou, Fatma Kilinç-Karzan, Zachary C. Lipton, Alan L. Montgomery
A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits. CoRR (2023)
Nam Ho-Nguyen, Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity. INFORMS J. Optim. 5 (2) (2023)
C. J. Argue, Fatma Kilinç-Karzan, Alex L. Wang
Necessary and Sufficient Conditions for Rank-One-Generated Cones. Math. Oper. Res. 48 (1) (2023)
Nam Ho-Nguyen, Fatma Kilinç-Karzan
Risk Guarantees for End-to-End Prediction and Optimization Processes. Manag. Sci. 68 (12) (2022)
Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens. Math. Program. 195 (1) (2022)
Nam Ho-Nguyen, Fatma Kilinç-Karzan, Simge Küçükyavuz, Dabeen Lee
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity. Math. Program. 196 (1) (2022)
Alex L. Wang, Fatma Kilinç-Karzan
The generalized trust region subproblem: solution complexity and convex hull results. Math. Program. 191 (2) (2022)
Alex L. Wang, Fatma Kilinç-Karzan
Accelerated first-order methods for a class of semidefinite programs. CoRR (2022)
Alex L. Wang, Fatma Kilinç-Karzan
On the tightness of SDP relaxations of QCQPs. Math. Program. 193 (1) (2022)
Liu Leqi, Fatma Kilinç-Karzan, Zachary C. Lipton, Alan L. Montgomery
Rebounding Bandits for Modeling Satiation Effects. NeurIPS (2021)
Nam Ho-Nguyen, Fatma Kilinç-Karzan
Technical Note - Dynamic Data-Driven Estimation of Nonparametric Choice Models. Oper. Res. 69 (4) (2021)
Alex L. Wang, Yunlei Lu, Fatma Kilinç-Karzan
Implicit regularity and linear convergence rates for the generalized trust-region subproblem. CoRR (2021)
Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
Faster algorithms for extensive-form game solving via improved smoothing functions. Math. Program. 179 (1) (2020)
Violet Xinying Chen, Fatma Kilinç-Karzan
Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences. CoRR (2020)
Liu Leqi, Fatma Kilinç-Karzan, Zachary C. Lipton, Alan L. Montgomery
Rebounding Bandits for Modeling Satiation Effects. CoRR (2020)
Alex L. Wang, Fatma Kilinç-Karzan
On Convex Hulls of Epigraphs of QCQPs. IPCO (2020)
Alex L. Wang, Fatma Kilinç-Karzan
The Generalized Trust Region Subproblem: solution complexity and convex hull results. CoRR (2019)
Xiao Liu, Fatma Kilinç-Karzan, Simge Küçükyavuz
On intersection of two mixing sets with applications to joint chance-constrained programs. Math. Program. 175 (1-2) (2019)
Nam Ho-Nguyen, Fatma Kilinç-Karzan
Exploiting problem structure in optimization under uncertainty via online convex optimization. Math. Program. 177 (1-2) (2019)
Nam Ho-Nguyen, Fatma Kilinç-Karzan
Primal-Dual Algorithms for Convex Optimization via Regret Minimization. IEEE Control. Syst. Lett. 2 (2) (2018)
Nam Ho-Nguyen, Fatma Kilinç-Karzan
Online First-Order Framework for Robust Convex Optimization. Oper. Res. 66 (6) (2018)
Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. CoRR (2017)
Nam Ho-Nguyen, Fatma Kilinç-Karzan
A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants. SIAM J. Optim. 27 (3) (2017)
Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. EC (2017)
Samuel Burer, Fatma Kilinç-Karzan
How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162 (1-2) (2017)
Fatma Kilinç-Karzan, Daniel E. Steffy
On sublinear inequalities for mixed integer conic programs. Math. Program. 159 (1-2) (2016)
Fatma Kilinç-Karzan
On Minimal Valid Inequalities for Mixed Integer Conic Programs. Math. Oper. Res. 41 (2) (2016)
Fatma Kilinç-Karzan, Sercan Yildiz
Two-term disjunctions on the second-order cone. Math. Program. 154 (1-2) (2015)
Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm
Faster First-Order Methods for Extensive-Form Game Solving. EC (2015)
Adams Wei Yu, Fatma Kilinç-Karzan, Jaime G. Carbonell
Saddle Points and Accelerated Perceptron Algorithms. ICML (2014)
Ersin Körpeoglu, Zachary Kurtz, Fatma Kilinç-Karzan, Sunder Kekre, Pat A. Basu
Business Analytics Assists Transitioning Traditional Medicine to Telemedicine at Virtual Radiologic. Interfaces 44 (4) (2014)
Fatma Kilinç-Karzan, Sercan Yildiz
Two-Term Disjunctions on the Second-Order Cone. IPCO (2014)
Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski
Randomized first order algorithms with applications to ℓ 1-minimization. Math. Program. 142 (1-2) (2013)
Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski
On unified view of nullspace-type conditions for recoveries associated with general sparsity structures CoRR (2012)
Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski
On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing. SIAM J. Matrix Anal. Appl. 32 (3) (2011)
Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski
-recovery for sparse signals with sign restrictions. Math. Program. 127 (1) (2011)
Anatoli Iouditski, Fatma Kilinç-Karzan, Arkadi Nemirovski, Boris T. Polyak
On the accuracy of l1-filtering of signals with block-sparse structure. NIPS (2011)
Fatma Kilinç-Karzan, Alejandro Toriello, Shabbir Ahmed, George L. Nemhauser, Martin W. P. Savelsbergh
Approximating the stability region for binary mixed-integer programs. Oper. Res. Lett. 37 (4) (2009)
Fatma Kilinç-Karzan, George L. Nemhauser, Martin W. P. Savelsbergh
Information-based branching schemes for binary linear mixed integer problems. Math. Program. Comput. 1 (4) (2009)