optimization lecture
The 40 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.
- Discrete Optimization Lecture 15: Dynamic ProgrammingDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 14: List ColouringDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 13: Edge ColouringDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 12: Graph Colouring, Perfect Graphs and the Stable Set PolytopeDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 11: Max-Flow and Ford–Fulkerson AlgorithmDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 10: Matching Polytope and Network FlowsDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 9: Stable Marriage Problem and Tutte–Berge FormulaDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 8: Weighted Matching and Perfect Matching Problems in Bipartite GraphsDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 7: Introduction to Matchings, Kőnig's TheoremDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 6: Strong Duality for Linear ProgrammingDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 5: Linear Programming Basics and Weak DualityDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 4: Introduction to Linear ProgrammingDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 3: Reductions, hardness, NP-completeness, SAT, 3-SAT, undecidabilityDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 2: Decision Problems, Complexity classes. Philosophy of DualityDiscrete Optimization (University of Victoria Math 428/529)Notes
- Discrete Optimization Lecture 1: Introduction, algorithms, Big O, Shortest PathDiscrete Optimization (University of Victoria Math 428/529)Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 15 Follow the Regularized LeaderConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 14 Online (Projected) Gradient DescentConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 13 Learning from Expert AdviceConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 12 Interior Point MethodsConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 11 Newton's MethodConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 10 KKT Conditions and Usage of DualityConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 9 DualityConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 8 Stochastic (Sub)gradient MethodConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 7 Proximal Gradient Descent (Part II)Convex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 6 Subgradient Method and Proximal Gradient DescentConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 5 SubgradientConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 4 Gradient DescentConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 3 Canonical Problem FormsConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 2 Convex Optimization BasicsConvex Optimization Spring 2020Notes
- [CS292F 2020 Spring] Convex Optimization: Lecture 1 Intro to convex optimizationConvex Optimization Spring 2020Notes
- Ke Wei: Low rank matrix recovery From iterative hard thresholding to Riemannian optimizationHIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Hans Feichtinger: Fourier Analysis via the Banach Gelfand TripleHIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Suvrit Sra: Lecture series on Aspects of Convex, Nonconvex, and Geometric Optimization (Lecture 1)HIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Suvrit Sra: Lecture series on Aspects of Convex, Nonconvex, and Geometric Optimization (Lecture 2)HIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Suvrit Sra: Lecture series on Aspects of Convex, Nonconvex, and Geometric Optimization (Lecture 3)HIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Karlheinz Gröchenig: Gabor Analysis and its Mysteries (Lecture 1)HIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Felix Krahmer: The Restricted Isometry Property for Random Gabor Synthesis MatricesHIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- David Gross: The Toric Code Finite WH meets Topological OrderHIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Romanos Malikiosis: Full spark Gabor frames in finite dimensionsHIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
- Xiadong Li: Phase Retrieval from Convex to Nonconvex MethodsHIM Lectures: Trimester Program "Mathematics of Signal Processing"Notes
This playlist:.m3u.plsAll the feeds behind it
