Class 14, C&O 367
-
Optimality Conditions for Convex Programs cont...
-
Linearizing cone, tangent cone, Cone of gradients
-
(weakest) constraint qualification
-
Farkas' Lemma (with proof using the Lemma: K is a closest convex cone if
and only if K equals its second polar)