12 citations · 24 across the 15 of their papers we have counts for
4 papers · 1 filter
On the power of linear programming for K-means clustering
Antonio De Rosa, Aida Khajavirad, Yakun Wang
In [SIAM J. Optim., 2022], the authors introduced a new linear programming (LP) relaxation for K-means clustering. In this paper, we further investigate both theoretical and comput…
Explicit convex hull description of bivariate quadratic sets with indicator variables
Antonio De Rosa, Aida Khajavirad
We consider the nonconvex set , which is closely related to the feasible region of several diff…
Efficient Joint Object Matching via Linear Programming
Antonio De Rosa, Aida Khajavirad
Joint object matching, also known as multi-image matching, namely, the problem of finding consistent partial maps among all pairs of objects within a collection, is a crucial task…
The ratio-cut polytope and K-means clustering
Antonio De Rosa, Aida Khajavirad
We introduce the ratio-cut polytope defined as the convex hull of ratio-cut vectors corresponding to all partitions of points in into at most clusters. This p…