Relaxing Topological Barriers in Geometry Processing
Geometric optimization problems are full of topological barriers that hinder optimization, leading to nonconvexity, initialization-dependence, and local minima. This thesis explores convex relaxation as a powerful guide and tool for reframing such problems. We bring the tools of semidefinite relaxat...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
Massachusetts Institute of Technology
2023
|
| Online Access: | https://hdl.handle.net/1721.1/152846 https://orcid.org/0000-0002-1931-5673 |