Learning to Design Convex Relaxations for Nonconvex Optimization
DGX agentarXiv:2610.16948v1 Announce Type: new Abstract: Convex relaxations make nonconvex optimization tractable by replacing hard nonconvex problems with convex surrogates that give valid bounds. Yet their d