This finds the global minimum (convex objective) and is extremely fast even when we have over a hundred million real variables.
we update where Σ def = Σ −1 is the inverse covariance matrix and W k def = {i : k ∈ M i }.