SDPRLayers: Certifiable Backpropagation through Polynomial Optimization Problems in Robotics
A recent set of techniques in the robotics community, known as certifiably correct methods, frames robotics problems as polynomial optimization problems (POPs) and applies convex, semidefinite programming (SDP) relaxations to either find or certify their global optima. In parallel, differentiable op…