Lecture notes
Notes will usually be posted the day before lecture.
Lecture 1 (Jan 11): introduction [pdf] [one]

Lecture 2 (Jan 13): convex functions [pdf] [one]

Lecture 3 (Jan 18): dual sets and functions [pdf] [one]

Lecture 45 (Jan 20, 25): dual programs [pdf] [one]

Lecture 6 (Jan 27): John ellipsoid [pdf] [one]

Lecture 7 (Feb 1): gradient descent [pdf] [one]

Lecture 8 (Feb 3): minimum cut [pdf] [one]

Lecture 9 (Feb 8): multiplicative weight update method [pdf] [one]

Lecture 10 (Feb 10): mirror descent [pdf] [one]

Lecture 11 (Feb 15): approximate Caratheodory theorem [pdf] [one]

Lecture 12 (Feb 17): interior point method [pdf] [one]

Lecture 13 (Mar 1): linear programming [pdf] [one]

Lecture 14 (Mar 3): selfconcordant barrier [pdf] [one]

Lecture 15 (Mar 8): cutting plane methods [pdf] [one]

Lecture 16 (Mar 10): polytope intersection [pdf] [one]

Lecture 17 (Mar 15): geometric decent [pdf] [one]

Lecture 18 (Mar 17): introduction to convex geometry [pdf] [one]

Lecture 19 (Mar 22): BrunnMinkowski inequality [pdf] [one]

Lecture 20 (Mar 24): measure concentration [pdf] [one]

Lecture 21 (Mar 29): logconcavity [pdf] [one]

Lecture 22 (Mar 31): optimization applications [pdf] [one]

Lecture 23 (Apr 5): random sampling in convex body [pdf] [one]

Lecture 24 (Apr 7): expansion in convex body [pdf] [one]
