On the Expressive Power of GNNs to Solve Linear SDPs
DGX agentarXiv: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. Ho