Login / Signup

Towards Understanding The Semidefinite Relaxations of Truncated Least-Squares in Robust Rotation Search.

Liangzu PengMahyar FazlyabRené Vidal
Published in: CoRR (2022)
Keyphrases
  • semidefinite
  • least squares
  • semidefinite programming
  • convex relaxation
  • sufficient conditions
  • higher dimensional
  • interior point methods
  • feature extraction
  • evolutionary algorithm
  • convex sets