Graph matching via convex relaxations

Tue, Dec 8, 2015, 12:30 pm

I'll talk about a few convex relaxations for graph matching, encoded as a quadratic assignment problem (QAP). I'll discuss a popular, but expensive, semidefinite programming (SDP) relaxation for the QAP by Zhao et al. If there's time, I'll talk about how we might relax it further to solve much larger problems in the case where one of the graphs is sparse.

Location: 
Fine Hall 214
Speaker(s): 
Event category: 

Upcoming Events

*Online Conference* Analysis of Fluids and Related Topics: Traveling wave solutions to the free boundary Navier-Stokes equations, Speaker: Ian Tice, Carnegie Mellon University

*Online Seminar* Graduate Student Seminar: Locally Interacting Markov Chains on Random and Heterogeneous Graphs, Speaker, Mira Gordin

VIRTUAL IDeAS Seminar: Yong Sheng Soh, National University of Singapore

Wed, Mar 17, 2021, 10:30 am
Location: via Zoom - Link TBA