1 paper · 1 filter
Liangting Wu, Roberto Tron
Many nonconvex problems in robotics can be relaxed into convex formulations via Semi-Definite Programming (SDP) that can be solved to global optimality. The practical quality of th…