2 citations · 2 across the 8 of their papers we have counts for
22 papers
Parameter-Free Non-Ergodic Extragradient Algorithms for Solving Monotone Variational Inequalities
Lingqing Shen, Fatma Kılınç-Karzan
Monotone variational inequalities (VIs) provide a unifying framework for convex minimization, equilibrium computation, and convex-concave saddle-point problems. Extragradient-type…
Efficient Online Large-Margin Classification via Dual Certificates
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Ellie Nguyen +1
Online classification is a central problem in optimization, statistical learning and data science. Classical algorithms such as the perceptron offer efficient updates and finite mi…
Mistake, Manipulation and Margin Guarantees in Online Strategic Classification
Lingqing Shen, Nam Ho-Nguyen, Khanh-Hung Giang-Tran +1
We consider an online strategic classification problem where each arriving agent can manipulate their true feature vector to obtain a positive predicted label, while incurring a co…
On semidefinite descriptions for convex hulls of quadratic programs
Alex L. Wang, Fatma Kilinc-Karzan
Quadratically constrained quadratic programs (QCQPs) are a highly expressive class of nonconvex optimization problems. While QCQPs are NP-hard in general, they admit a natural conv…
Constrained Optimization of Rank-One Functions with Indicator Variables
Soroosh Shafiee, Fatma Kılınç-Karzan
Optimization problems involving minimization of a rank-one convex function over constraints modeling restrictions on the support of the decision variables emerge in various machine…
Accelerated first-order methods for a class of semidefinite programs
Alex L. Wang, Fatma Kilinc-Karzan
This paper introduces a new storage-optimal first-order method (FOM), CertSDP, for solving a special class of semidefinite programs (SDPs) to high accuracy. The class of SDPs that…