On the tightness of semidefinite relaxations for rotation estimation

DOI10.1007/s10851-021-01054-yOpenAlexW3203687845MaRDI QIDQ2127273

Fredrik Kahl, Viktor Larsson, Lucas Brynte, Carl Olsson, José Pedro Iglesias

Publication date: 20 April 2022

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.02099

zbMATH Keywords

dualityalgebraic geometrysum-of-squaresrotation estimationalmost minimal varietiesSDP relaxations

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Uses Software

• SE-Sync

Cites Work

• Unnamed Item
• Rotation averaging
• Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
• The degree of \(\text{SO}(n,\mathbb{C})\)
• \(L_q\)-closest-point to affine subspaces using the generalized Weiszfeld algorithm
• The geometry of SDP-exactness in quadratic optimization
• A bounded degree SOS hierarchy for polynomial optimization
• Globally optimal estimates for geometric reconstruction problems
• Global Optimization with Polynomials and the Problem of Moments
• Sums of squares and varieties of minimal degree
• ORBITOPES
• Near-Optimal Bounds for Phase Synchronization
• The Moment-SOS Hierarchy
• Global Registration of Multiple Point Clouds Using Semidefinite Programming

This page was built for publication: On the tightness of semidefinite relaxations for rotation estimation