worst case
The 30 most recent episodes and tracks on this topic.
Saves to your Watch queue, to pick up on another day or another device.
Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.
- Preconditioned Proximal Point Methods | Re-Live of the 27th lectureConvex AnalysisNotes
- The Proximal Point Algorithm | Re-Live of the 26th lectureConvex AnalysisNotes
- Relaxed Mann Iterations | Re-Live of the 25th lectureConvex AnalysisNotes
- Resolvents and non-expansive operators | Re-Live of the 24th lectureConvex AnalysisNotes
- Monotone Operators | Re-Live of the 23rd lectureConvex AnalysisNotes
- Analysis of the Proximal Gradient Method and its Acceleration | Re-Live of the 22nd lectureConvex AnalysisNotes
- Accelerated Gradient Descent | Re-Live of the 21st lectureConvex AnalysisNotes
- Subgradient Method and Gradient Descent | Re-Live of the 20th lectureConvex AnalysisNotes
- More Worst Case Analysis | Re-Live of the 19th lectureConvex AnalysisNotes
- Convergence Rates and Worst Case Analysis | Re-Live of the 18th lectureConvex AnalysisNotes
- Classes of Optimisation Problems | Re-Live of the 17th lectureConvex AnalysisNotes
- Examples of Duality & Optimality Systems | Re-Live of the 16th lectureConvex AnalysisNotes
- Fenchel-Rockafellar Duality | Re-Live of the 15th lectureConvex AnalysisNotes
- Conjugation calculus | Re-Live of the 14th lectureConvex AnalysisNotes
- Convex conjugation | Re-Live of the 13th lectureConvex AnalysisNotes
- Beyond Worst-Case Analysis (Lecture 15: Smoothed Complexity and Pseudopolynomial-Time Algorithms)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 14: Smoothed Analysis of Pareto Curves)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 13: Smoothed Analysis of Local Search)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 12: LP Decoding/Introduction to Smoothed Analysis)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 11: LP Decoding)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 10: Planted and Semi-Random Graph Models)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 9: A Taste of Compressive Sensing)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 8: Exact Recovery in Stable Cut Instances)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 7: Perturbation Stability and Single-Link++)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 6: Clustering in Approximation-Stable Instances)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 5: Computing Independent Sets:A Parameterized Analysis)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 4: Parameterized Analysis of Online Paging)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 3: Online Paging and Resource Augmentation)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 2: Instance-Optimal Geometric Algorithms)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
- Beyond Worst-Case Analysis (Lecture 1: Three Motivating Examples)Beyond Worst-Case Analysis (Stanford CS264, Fall 2014)Notes
This playlist:.m3u.plsAll the feeds behind it
