October 08, 2019, 4:15 PM - 5:15 PM
Auditorium (Amphitheatre Banque Nationale)
Click here for map.
Aida Khajavirad, Rutgers University
We propose polyhedral relaxations for several NP-hard problems that arise in community detection and data clustering. We study the theoretical properties of these relaxations and compare them with the widely-used semi-definite programming relaxations in data-science literature.