Class 14, C&O 367



  1. Optimality Conditions for Convex Programs cont...
    1. Linearizing cone, tangent cone, Cone of gradients
    2. (weakest) constraint qualification
    3. Farkas' Lemma (with proof using the Lemma: K is a closest convex cone if and only if K equals its second polar)