RSS Amplifier

Topic · lecture convexity

lecture convexity

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.

  1. Lecture 15 Convex Optimization Barrier MethodCMU: Fall 2018: 10-725 Convex OptimizationNotes
  2. Lecture 14 Convex Optimization Newton's MethodCMU: Fall 2018: 10-725 Convex OptimizationNotes
  3. Lecture 13 Convex Optimization Daily Uses and CorrespondencesCMU: Fall 2018: 10-725 Convex OptimizationNotes
  4. Lecture 12 Convex Optimization Karush Kuhn Tucker ConditionsCMU: Fall 2018: 10-725 Convex OptimizationNotes
  5. Lecture 11 Convex OptimizationCMU: Fall 2018: 10-725 Convex OptimizationNotes
  6. Lecture 10 Convex OptimizationCMU: Fall 2018: 10-725 Convex OptimizationNotes
  7. Lecture 09 Convex OptimizationCMU: Fall 2018: 10-725 Convex OptimizationNotes
  8. Lecture 08 Proximal Gradient Descent And AccelerationCMU: Fall 2018: 10-725 Convex OptimizationNotes
  9. Lecture 07 Convex OptimizationCMU: Fall 2018: 10-725 Convex OptimizationNotes
  10. Lecture 06 Convex OptimizationCMU: Fall 2018: 10-725 Convex OptimizationNotes
  11. Lecture 15: Barrier methodFall 2016: Convex Optimization (10-725/36-725)Notes
  12. Lecture 14: Newton's methodFall 2016: Convex Optimization (10-725/36-725)Notes
  13. Lecture 13: Duality uses and correspondencesFall 2016: Convex Optimization (10-725/36-725)Notes
  14. Lecture 12: KKT conditionsFall 2016: Convex Optimization (10-725/36-725)Notes
  15. Lecture 11:Duality in general programsFall 2016: Convex Optimization (10-725/36-725)Notes
  16. Lecture 10: Duality in linear programsFall 2016: Convex Optimization (10-725/36-725)Notes
  17. Lecture 9: Proximal gradient descent and acceleration (continued)Fall 2016: Convex Optimization (10-725/36-725)Notes
  18. Lecture 8: Subgradient method (continued); Proximal gradient descent and accelerationFall 2016: Convex Optimization (10-725/36-725)Notes
  19. Lecture 7: Subgradients (continued); Subgradient methodFall 2016: Convex Optimization (10-725/36-725)Notes
  20. Lecture 6: Gradient descent (continued); SubgradientsFall 2016: Convex Optimization (10-725/36-725)Notes
  21. Lecture 7: Subgradient method continued10-725 OptimizationNotes
  22. Lecture 6: Subgradient method10-725 OptimizationNotes
  23. Lecture 5: Gradient descent revisited10-725 OptimizationNotes
  24. Lecture 9: Acceleration10-725 OptimizationNotes
  25. Lecture 10: Matrix differentials10-725 OptimizationNotes
  26. Lecture 4: More convexity; first-order methods10-725 OptimizationNotes
  27. Lecture 3: Convexity10-725 OptimizationNotes
  28. Lecture 2: Intro; Gradient descent10-725 OptimizationNotes
  29. Lecture 1: Introduction10-725 OptimizationNotes
  30. Lecture 11: Matrix differentials; Newton's method10-725 OptimizationNotes