15 citations · 26 across the 13 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.OC2021
Relaxations for Non-Separable Cardinality/Rank Penalties
Carl Olsson, Daniele Gerosa, Marcus Carlsson
Rank and cardinality penalties are hard to handle in optimization frameworks due to non-convexity and discontinuity. Strong approximations have been a subject of intense study and…
cs.CV2021
On the Tightness of Semidefinite Relaxations for Rotation Estimation
Lucas Brynte, Viktor Larsson, José Pedro Iglesias +2
Why is it that semidefinite relaxations have been so successful in numerous applications in computer vision and robotics for solving non-convex optimization problems involving rota…