Let be a compact group and let . We define the Non-Unique Games (NUG) problem as finding to minimize . We devise a relaxation of the NUG problem to a semidefinite program (SDP) by taking the Fourier transform of over , which can then be solved efficiently. The NUG framework can be seen as a generalization of the little Grothendieck problem over the orthogonal group and the Unique Games problem and includes many practically relevant problems, such as the maximum likelihood estimator} to registering bandlimited functions over the unit sphere in -dimensions and orientation estimation in cryo-Electron Microscopy.
View on arXiv