Speaker
Prof.
Justin Solomon
(MIT)
Description
We motivate our discussion by developing intuition for the space of convex optimization problems, motivated by function smoothing, shortest path computation, and other problems in geometry. We will see that a rich class of problems can be understood through the lens of convex optimization; moreover, even when a problem is not obviously convex, a series of strategies can be used to derive a convex relaxation whose solution may approximate the solution to or even solve the original problem.
Author
Prof.
Justin Solomon
(MIT)