Fatma Kilinç-Karzan

Orcid: 0000-0001-5939-4575

Affiliations:
  • Carnegie Mellon University, PA, USA


According to our database1, Fatma Kilinç-Karzan authored at least 38 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Mistake, Manipulation and Margin Guarantees in Online Strategic Classification.
CoRR, 2024

2023
Implicit Regularity and Linear Convergence Rates for the Generalized Trust-Region Subproblem.
SIAM J. Optim., June, 2023

An online convex optimization-based framework for convex bilevel optimization.
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

Necessary and Sufficient Conditions for Rank-One-Generated Cones.
Math. Oper. Res., February, 2023

Constrained Optimization of Rank-One Functions with Indicator Variables.
CoRR, 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
Risk Guarantees for End-to-End Prediction and Optimization Processes.
Manag. Sci., December, 2022

On the tightness of SDP relaxations of QCQPs.
Math. Program., 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

Accelerated first-order methods for a class of semidefinite programs.
CoRR, 2022

2021
Technical Note - Dynamic Data-Driven Estimation of Nonparametric Choice Models.
Oper. Res., 2021

Rebounding Bandits for Modeling Satiation Effects.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Faster algorithms for extensive-form game solving via improved smoothing functions.
Math. Program., 2020

Online Convex Optimization Perspective for Learning from Dynamically Revealed Preferences.
CoRR, 2020

On Convex Hulls of Epigraphs of QCQPs.
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
Online First-Order Framework for Robust Convex Optimization.
Oper. Res., 2018

Primal-Dual Algorithms for Convex Optimization via Regret Minimization.
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

How to convexify the intersection of a second order cone and a nonconvex quadratic.
Math. Program., 2017

Theoretical and Practical Advances on Smoothing for Extensive-Form Games.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

2016
On sublinear inequalities for mixed integer conic programs.
Math. Program., 2016

On Minimal Valid Inequalities for Mixed Integer Conic Programs.
Math. Oper. Res., 2016

2015
Two-term disjunctions on the second-order cone.
Math. Program., 2015

Faster First-Order Methods for Extensive-Form Game Solving.
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

Saddle Points and Accelerated Perceptron Algorithms.
Proceedings of the 31th International Conference on Machine Learning, 2014

2013
Randomized first order algorithms with applications to ℓ 1-minimization.
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

On the accuracy of l1-filtering of signals with block-sparse structure.
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
Approximating the stability region for binary mixed-integer programs.
Oper. Res. Lett., 2009

Information-based branching schemes for binary linear mixed integer problems.
Math. Program. Comput., 2009


  Loading...