Fatma Kilinç-Karzan

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

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


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

Rebounding Bandits for Modeling Satiation Effects.
CoRR, 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

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

The Generalized Trust Region Subproblem: solution complexity and convex hull results.
CoRR, 2019

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

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

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

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

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

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

Randomized first order algorithms with applications to ℓ 1-minimization.
Math. Program., 2013

On unified view of nullspace-type conditions for recoveries associated with general sparsity structures
CoRR, 2012

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

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