Solving graph equipartition SDPs on an algebraic variety
![](https://iora.nus.edu.sg/wp-content/uploads/2024/04/Screenshot-2024-04-22-at-12.32.19 PM-877x1024.png)
Semidefinite programs are generally challenging to solve due to their high dimensionality. Burer and Monteiro developed a non-convex approach to solve linear SDP problems by applying its low rank property. […]