~/talk

Duality 1

links:none on file
slides:none on file

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

  1. 0:00Introduction to duality
  2. 2:55Discrete vs continuous problems
  3. 5:18The concept of relaxation
  4. 7:40Properties of relaxations
  5. 12:50Basics of duality
  6. 14:30Conic optimization
  7. 19:35Dual cones and SDP
  8. 25:55Weak and strong duality
  9. 28:50Strong duality proof
  10. 37:38Complementary slackness
  11. 43:14Lovasz theta function
  12. 49:42Perfect graphs
  13. 55:10Sandwich theorem and concluding
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.