Class 12, C&O 367



  1. Convex Programming and KKT Conditions
    1. Definition of a convex program
    2. Separation and Support Theorems for convex sets
    3. Theorem 5.1.1 and the equivalent results using polar cones
    4. Pshenichnyi optimality conditions (geometric optimality conditions)