Algorithmic Conversion of Polynomial Optimization Problems of Noncommuting Variables to Semidefinite Programming Relaxations
