Exactness of the DNN Relaxation for Random Standard Quadratic Programs

We study the doubly nonnegative (DNN) relaxation of the standard quadratic optimization problem $$\min \{x^{\mathrm{\top }}Qx:x\in {\mathrm{\Delta }}^{n-1}\},{\mathrm{\Delta }}^{n-1}:=\{x\in {\mathbb{R}}_{+}^n:{\mathbb{1}}^{\mathrm{\top }}x=1\},$$ for random symmetric matrices with independent diagonal and off-diagonal entries. Let $m_n:={\min }_{1\le i\le n}{Q}_{ii}$ and set $M:=Q-m_{n}E$, where $E$ is the all-ones matrix. The negative off-diagonal entries of $M$ define a defect graph $G_n^{-}$. Under entrywise independence, absolute continuity, and the tail-decay condition $n^5\mathbb{E}[F_O(m_n{)}^4]\to 0$, where $F_O$ is the off-diagonal distribution function, we prove that with probability tending to one every defect component has size at most $4$. On this event, the shifted DNN value decomposes over defect components. Since the DNN and completely positive cones coincide in dimensions at most four, each local relaxation is exact. A finite KKT-candidate argument gives local uniqueness, and absolute continuity rules out ties, so the global DNN optimizer is unique and rank one. The graph estimate uses the fact that every connected component of size at least five contains a tree on exactly five vertices. For Gaussian orthogonal ensemble data, we prove the explicit bound $$\mathbb{P}\left(\text{the DNN optimizer is unique and rank one}\right)\ge 1-K\frac{(\ln n{)}^2}{n^3}\mathrm{.}$$ On the same event, the exact optimizer can be recovered in $O(n^2)$ time by constructing the defect graph and solving constant-size local KKT systems. We also verify the tail condition for variance-tuned Gaussian Wigner models, heavy-tailed laws, and finite-lower-endpoint laws.