On the Expressive Power of GNNs to Solve Linear SDPs
arXiv:2604.27786v1 Announce Type: new
Abstract: Semidefinite programs (SDPs) are a powerful framework for convex optimization and for constructing strong relaxations of hard combinatorial problems. However, solving large SDPs can be computationally ex…