Exploring Advanced Algorithms Compsci 224 Lecture 11
Exploring Advanced Algorithms Compsci 224 Lecture 11 reveals several interesting facts.
- Simplex wrap-up, strong duality, complementary slackness, ellipsoid, intro to interior point.
- Khintchine, decoupling, Hanson-Wright, proof of distributional JL lemma.
- Randomized paging, packing/covering linear programs, weak duality, approximate complementary slackness, primal/dual online ...
- Logistics, course topics, word RAM, predecessor, van Emde Boas, y-fast tries. Please see Problem 1 of Assignment 1 at ...
- Online primal/dual: e/(e-1) ski rental, set cover; approximation
In-Depth Information on Advanced Algorithms Compsci 224 Lecture 11
Approximation Guest FPTAS (knapsack), FPRAS (DNF counting), semidefinite programming, Goemans-Williamson MAXCUT Power of random signs: ℓ2 norm estimation, subspace embeddings (regression), Johnson-Lindenstrauss, deterministic point ...
second order methods (Newton's method), path-following interior point wrap-up.
Stay tuned for more updates related to Advanced Algorithms Compsci 224 Lecture 11.
