Tutte Colloquium - Jonathan Borwein

Title: Douglas-Rachford feasibility methods for matrix completion problems

Abstract: Many successful non-convex applications of the Douglas-Rachford reflection method for finding a point in the intersection of two sets can be viewed as the reconstruction of a matrix, with known properties, from a subset of its entries.  

In this talk we discuss recent successful applications of the method to
a variety of (real) matrix reconstruction problems, both convex and
non-convex. These include reconstructing proteins, solving Sudoku and
finding Hadamard matrices.