Goldfarb-Idnani Revisited:Invariants, Certificates, and the Limits of Guessing

What the math gives to ML

The paper exposes a useful distinction between guessing an active set and certifying a candidate solution for strictly convex quadratic programs. Its transferable asset is a rank-aware, certificate-producing solver: arbitrary inequality guesses are unsafe because the working-set matrix C_A^T G^{-1} C_A is positive definite only when the guessed constraint normals are linearly independent, but any candidate satisfying the KKT conditions is globally correct. This suggests replacing heuristic projection or penalty steps in constrained neural modules with small active-set QP solves that explicitly validate primal feasibility, dual signs, stationarity, and rank. The approach is most promising for differentiable constrained layers, portfolio or control heads, and neural optimizers enforcing linear resource or monotonicity constraints rather than as a generic replacement for Adam.