On the tightness of semidefinite relaxations for rotation estimation
From MaRDI portal
Publication:2127273
Recommendations
- Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions
- On the local stability of semidefinite relaxations
- Global registration of multiple point clouds using semidefinite programming
- scientific article; zbMATH DE number 6263712
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
Cites work
- L_q-closest-point to affine subspaces using the generalized Weiszfeld algorithm
- A bounded degree SOS hierarchy for polynomial optimization
- Global optimization with polynomials and the problem of moments
- Global registration of multiple point clouds using semidefinite programming
- Globally optimal estimates for geometric reconstruction problems
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Near-optimal bounds for phase synchronization
- ORBITOPES
- Rotation averaging
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Sums of squares and varieties of minimal degree
- The degree of \(\text{SO}(n,\mathbb{C})\)
- The geometry of SDP-exactness in quadratic optimization
- The moment-SOS hierarchy. Lectures in probability, statistics, computational geometry, control and nonlinear PDEs
Cited in
(2)
This page was built for publication: On the tightness of semidefinite relaxations for rotation estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127273)