Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT.

arXiv:2610.19043v1 Announce Type: cross Abstract: Because its binary optimization landscape contains exponentially many local optima, MAX-CUT is highly sensitive to initialization. We study Particle Polynomial Relaxation (PPR), a moment-based nonconvex continu