Speaker
Prof.
Justin Solomon
(MIT)
Description
Next, we will study how convex relaxation techniques lead to tractable formulations of chal-lenging computational geometry problems. We will start with early examples of linear pro-gram relaxations for consistent segmentation and conclude with modern research using semidefinite and sum-of-squares relaxations to tackle particularly challenging problems in computer-aided design and surface matching. We will see that convex relaxations can be unreasonably effective in geometry, motivating open questions regarding the tightness of typical relaxations in this domain.
Author
Prof.
Justin Solomon
(MIT)