9:00 AM-10:00 AM
Chair: Hal Kierstead, Arizona State University
Room: Earth Science Center Auditorium
Semidefinite programming arises from the optimization over the convex cone of positive semidefinite matrices, and has been much studied lately. In this presentation, the speaker will describe its use to tackle combinatorial optimization problems, such as finding the maximum cut or sparsest cut in a graph, or computing its stability number. This tour d'horizon will include eigenvalue bounds, association schemes, and the embedding of finite metric spaces, among other topics.
Michel X. Goemans
University of Louvain, Belgium and
Department of Mathematics, Massachusetts Institute of Technology