P
Initializing...
Lemma 3.2 — the greedy sparse-simplex method is monotone, f(xᵏ⁺¹) ≤ f(xᵏ), with equality iff xᵏ = xᵏ⁺¹ is a CW-minimum · Prove2Me