Under independence and tail conditions on random symmetric matrices, the DNN relaxation of the standard quadratic program is exact with probability tending to 1, the optimizer is unique and rank one, and recoverable in O(n^2) time.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Exactness of the DNN Relaxation for Random Standard Quadratic Programs
Under independence and tail conditions on random symmetric matrices, the DNN relaxation of the standard quadratic program is exact with probability tending to 1, the optimizer is unique and rank one, and recoverable in O(n^2) time.