Lectures related to Convexifying Nonconvex Problems: SDP and SOCP Relaxations

Related lectures (32)

Covers Farkas' lemma, exploring the relationship between linear programs and the conditions for its validity.

Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.