SOURCE-LINKED INTELLIGENCE

Following a Unique Path: A Fast Certifier Applied to Outlier-Robust Pose Registration

arXiv · AI, language, vision and robotics · article · Sep 2, 2026 · UTC

Certifiable methods have arisen as a means to guarantee global optimality of solutions to non-convex problems using convex semidefinite programming (SDP) relaxations. The most performant of these methods use a local solver to obtain the candidate solution, and then certify its optimality using efficient linear algebra techniques. However, for many problems of interest in robotics, this local-solve-then-certify approach is impeded by a form of degeneracy in the relaxation, leaving a costly optimization of the relaxation as the only recourse. In this paper, we introduce our Central-Path Certifie

Read original source ↗ Open in workspace

recordType

paper

region

Global