Fatma Kilinç-Karzan
Orcid: 0000-0001-5939-4575Affiliations:
- Carnegie Mellon University, PA, USA
According to our database1,
Fatma Kilinç-Karzan
authored at least 39 papers
between 2009 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
1
3
4
5
1
2
2
2
2
2
1
1
1
1
2
2
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2025
Math. Program., January, 2025
2024
Math. Program., November, 2024
Oper. Res. Lett., 2024
CoRR, 2024
2023
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem.
SIAM J. Optim., June, 2023
Math. Program., April, 2023
Strong Formulations for Distributionally Robust Chance-Constrained Programs with Left-Hand Side Uncertainty Under Wasserstein Ambiguity.
INFORMS J. Optim., April, 2023
Math. Oper. Res., February, 2023
A Field Test of Bandit Algorithms for Recommendations: Understanding the Validity of Assumptions on Human Preferences in Multi-armed Bandits.
Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems, 2023
2022
Manag. Sci., December, 2022
The generalized trust region subproblem: solution complexity and convex hull results.
Math. Program., 2022
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens.
Math. Program., 2022
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity.
Math. Program., 2022
2021
Oper. Res., 2021
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021
2020
Math. Program., 2020
Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences.
CoRR, 2020
Proceedings of the Integer Programming and Combinatorial Optimization, 2020
2019
On intersection of two mixing sets with applications to joint chance-constrained programs.
Math. Program., 2019
Exploiting problem structure in optimization under uncertainty via online convex optimization.
Math. Program., 2019
2018
IEEE Control. Syst. Lett., 2018
2017
A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants.
SIAM J. Optim., 2017
Math. Program., 2017
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017
2016
Math. Oper. Res., 2016
2015
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015
2014
Business Analytics Assists Transitioning Traditional Medicine to Telemedicine at Virtual Radiologic.
Interfaces, 2014
Proceedings of the 31th International Conference on Machine Learning, 2014
2013
Math. Program., 2013
2012
On unified view of nullspace-type conditions for recoveries associated with general sparsity structures
CoRR, 2012
2011
On Low Rank Matrix Approximations with Applications to Synthesis Problem in Compressed Sensing.
SIAM J. Matrix Anal. Appl., 2011
Verifiable conditions of <i>ℓ</i><sub>1</sub>-recovery for sparse signals with sign restrictions.
Math. Program., 2011
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011
2009
Oper. Res. Lett., 2009
Math. Program. Comput., 2009