default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFatma Kilinç-Karzan
Person information
- affiliation: Carnegie Mellon University, PA, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j30]Fatma Kilinç-Karzan
, Simge Küçükyavuz, Dabeen Lee, Soroosh Shafieezadeh-Abadeh:
Technical Note - Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications. Oper. Res. 73(1): 251-269 (2025)- [j29]Alex L. Wang, Fatma Kilinç-Karzan:
Accelerated first-order methods for a class of semidefinite programs. Math. Program. 209(1): 503-556 (2025) - 2024
- [j28]Soroosh Shafiee, Fatma Kilinç-Karzan:
Constrained optimization of rank-one functions with indicator variables. Math. Program. 208(1): 533-579 (2024) - [j27]Alex L. Wang, Fatma Kilinç-Karzan:
On semidefinite descriptions for convex hulls of quadratic programs. Oper. Res. Lett. 54: 107108 (2024) - [i10]Lingqing Shen, Nam Ho-Nguyen, Khanh-Hung Giang-Tran, Fatma Kilinç-Karzan:
Mistake, Manipulation and Margin Guarantees in Online Strategic Classification. CoRR abs/2403.18176 (2024) - 2023
- [j26]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): 211-232 (2023) - [j25]C. J. Argue, Fatma Kilinç-Karzan, Alex L. Wang:
Necessary and Sufficient Conditions for Rank-One-Generated Cones. Math. Oper. Res. 48(1): 100-126 (2023) - [j24]Lingqing Shen, Nam Ho-Nguyen, Fatma Kilinç-Karzan:
An online convex optimization-based framework for convex bilevel optimization. Math. Program. 198(2): 1519-1582 (2023) - [j23]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): 1250-1278 (2023) - [c8]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: 504:1-504:16 - [i9]Soroosh Shafieezadeh-Abadeh, Fatma Kilinç-Karzan:
Constrained Optimization of Rank-One Functions with Indicator Variables. CoRR abs/2303.18158 (2023) - [i8]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 abs/2304.09088 (2023) - 2022
- [j22]Nam Ho-Nguyen, Fatma Kilinç-Karzan:
Risk Guarantees for End-to-End Prediction and Optimization Processes. Manag. Sci. 68(12): 8680-8698 (2022) - [j21]Alex L. Wang, Fatma Kilinç-Karzan:
The generalized trust region subproblem: solution complexity and convex hull results. Math. Program. 191(2): 445-486 (2022) - [j20]Alex L. Wang, Fatma Kilinç-Karzan:
On the tightness of SDP relaxations of QCQPs. Math. Program. 193(1): 33-73 (2022) - [j19]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): 283-326 (2022) - [j18]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): 641-672 (2022) - [i7]Alex L. Wang, Fatma Kilinç-Karzan:
Accelerated first-order methods for a class of semidefinite programs. CoRR abs/2206.00224 (2022) - 2021
- [j17]Nam Ho-Nguyen, Fatma Kilinç-Karzan:
Technical Note - Dynamic Data-Driven Estimation of Nonparametric Choice Models. Oper. Res. 69(4): 1228-1239 (2021) - [c7]Liu Leqi, Fatma Kilinç-Karzan, Zachary C. Lipton, Alan L. Montgomery:
Rebounding Bandits for Modeling Satiation Effects. NeurIPS 2021: 4003-4014 - [i6]Alex L. Wang, Yunlei Lu, Fatma Kilinç-Karzan:
Implicit regularity and linear convergence rates for the generalized trust-region subproblem. CoRR abs/2112.13821 (2021) - 2020
- [j16]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Faster algorithms for extensive-form game solving via improved smoothing functions. Math. Program. 179(1): 385-417 (2020) - [c6]Alex L. Wang, Fatma Kilinç-Karzan:
On Convex Hulls of Epigraphs of QCQPs. IPCO 2020: 419-432 - [i5]Violet Xinying Chen, Fatma Kilinç-Karzan:
Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences. CoRR abs/2008.10460 (2020) - [i4]Liu Leqi, Fatma Kilinç-Karzan, Zachary C. Lipton, Alan L. Montgomery:
Rebounding Bandits for Modeling Satiation Effects. CoRR abs/2011.06741 (2020)
2010 – 2019
- 2019
- [j15]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): 29-68 (2019) - [j14]Nam Ho-Nguyen, Fatma Kilinç-Karzan:
Exploiting problem structure in optimization under uncertainty via online convex optimization. Math. Program. 177(1-2): 113-147 (2019) - [i3]Alex L. Wang, Fatma Kilinç-Karzan:
The Generalized Trust Region Subproblem: solution complexity and convex hull results. CoRR abs/1907.08843 (2019) - 2018
- [j13]Nam Ho-Nguyen, Fatma Kilinç-Karzan:
Primal-Dual Algorithms for Convex Optimization via Regret Minimization. IEEE Control. Syst. Lett. 2(2): 284-289 (2018) - [j12]Nam Ho-Nguyen, Fatma Kilinç-Karzan:
Online First-Order Framework for Robust Convex Optimization. Oper. Res. 66(6): 1670-1692 (2018) - 2017
- [j11]Samuel Burer, Fatma Kilinç-Karzan:
How to convexify the intersection of a second order cone and a nonconvex quadratic. Math. Program. 162(1-2): 393-429 (2017) - [j10]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): 1485-1512 (2017) - [c5]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. EC 2017: 693 - [i2]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Theoretical and Practical Advances on Smoothing for Extensive-Form Games. CoRR abs/1702.04849 (2017) - 2016
- [j9]Fatma Kilinç-Karzan:
On Minimal Valid Inequalities for Mixed Integer Conic Programs. Math. Oper. Res. 41(2): 477-510 (2016) - [j8]Fatma Kilinç-Karzan, Daniel E. Steffy:
On sublinear inequalities for mixed integer conic programs. Math. Program. 159(1-2): 585-605 (2016) - 2015
- [j7]Fatma Kilinç-Karzan, Sercan Yildiz:
Two-term disjunctions on the second-order cone. Math. Program. 154(1-2): 463-491 (2015) - [c4]Christian Kroer, Kevin Waugh, Fatma Kilinç-Karzan, Tuomas Sandholm:
Faster First-Order Methods for Extensive-Form Game Solving. EC 2015: 817-834 - 2014
- [j6]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): 393-410 (2014) - [c3]Adams Wei Yu, Fatma Kilinç-Karzan, Jaime G. Carbonell:
Saddle Points and Accelerated Perceptron Algorithms. ICML 2014: 1827-1835 - [c2]Fatma Kilinç-Karzan, Sercan Yildiz:
Two-Term Disjunctions on the Second-Order Cone. IPCO 2014: 345-356 - 2013
- [j5]Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
Randomized first order algorithms with applications to ℓ 1-minimization. Math. Program. 142(1-2): 269-310 (2013) - 2012
- [i1]Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
On unified view of nullspace-type conditions for recoveries associated with general sparsity structures. CoRR abs/1207.1119 (2012) - 2011
- [j4]Anatoli B. Juditsky, Fatma Kilinç-Karzan, Arkadi Nemirovski:
Verifiable conditions of ℓ1-recovery for sparse signals with sign restrictions. Math. Program. 127(1): 89-122 (2011) - [j3]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): 1019-1029 (2011) - [c1]Anatoli Iouditski, Fatma Kilinç-Karzan, Arkadi Nemirovski, Boris T. Polyak:
On the accuracy of l1-filtering of signals with block-sparse structure. NIPS 2011: 1260-1268
2000 – 2009
- 2009
- [j2]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): 249-293 (2009) - [j1]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): 250-254 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-10 21:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
