3 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
From Majorization to Scaling: Advancing Convex Relaxations of Maximum Entropy Sampling Problem
Lingqing Shen, Fatma Kılınç-Karzan
In this paper, we study the maximum entropy sampling problem (MESP) and its variants. MESP seeks to identify a small subset of variables that maximizes the determinant of a covaria…
Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
Khanh-Hung Giang-Tran, Nam Ho-Nguyen, Fatma Kılınç-Karzan +1
We consider the convex bilevel optimization problem, also known as simple bilevel programming. There are two challenges in solving convex bilevel optimization problems. Firstly, st…
On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
Fatma Kılınç-Karzan, Shengding Sun
We study quadratic programs with ball constraints, and the strength of a lifted convex relaxation for it recently proposed by Burer (2024). Burer shows this relaxation is exact…
Exactness in SDP relaxations of QCQPs: Theory and applications
Fatma Kılınç-Karzan, Alex L. Wang
Quadratically constrained quadratic programs (QCQPs) are a fundamental class of optimization problems. In a QCQP, we are asked to minimize a (possibly nonconvex) quadratic function…
Conic Mixed-Binary Sets: Convex Hull Characterizations and Applications
Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee +1
We consider a general conic mixed-binary set where each homogeneous conic constraint involves an affine function of independent continuous variables and an epigraph variable as…