Yaguang Yang

Second-order arc-search SDP solvers no longer require two expensive KKT factorizations per step: a clever three-term complementarity decomposition slashes neural network verification solve times by 13% while preserving global $O(n \log(1/\varepsilon))$ convergence.