Duality 1
summary
Develops conic duality and Slater regularity for cone programs, shows the PSD and second‑order cones are self‑dual, and derives complementary slackness that forces the product of primal and dual PSD matrices to be the zero matrix. Builds a rank‑one PSD encoding of independent sets and formulates Lovász’s theta as an SDP that upper bounds alpha(G); proves Lovász theta equals alpha on perfect graphs and notes the ellipsoid method yields polynomial‑time computation. Theta body sits strictly between stab(G) and clique‑cover relaxations unless G is perfect.
AI-written summary · about
chapters (13)
- 0:00Introduction to duality
- 2:55Discrete vs continuous problems
- 5:18The concept of relaxation
- 7:40Properties of relaxations
- 12:50Basics of duality
- 14:30Conic optimization
- 19:35Dual cones and SDP
- 25:55Weak and strong duality
- 28:50Strong duality proof
- 37:38Complementary slackness
- 43:14Lovasz theta function
- 49:42Perfect graphs
- 55:10Sandwich theorem and concluding
related talks
54mPrimal-Dual Algorithms for Hyperbolic Programming Problems
44mCombinatorial Characterizations in Semidefinite Programming Duality: ...
01h 11m(Hidden) Symmetries of Computational Problems (continued)
32mLocal Statistics, Semidefinite Programming, and Community Detection
01h 12mGeodesic Convexity and Optimization
35mLocal Statistics, Semidefinite Programming, and Community Detection II
44mStructured Sparsity-Inducing Norms Through Submodular Functions
40mExponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones
