Convex Optimization (Stanford EE364A)

Advanced Mathematics by Adrian Staniec. 6 lectures, 8 hours. Covers: convex optimization duality linear programming least squares.

Lectures

1. Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 1 · 1 h 18 min
2. Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 2 · 1 h 20 min
3. Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 3 · 1 h 20 min
4. Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 4 · 1 h 20 min
5. Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 6 · 1 h 18 min
6. Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 7 · 1 h 21 min

Quick explainers

• What Is Mathematical Optimization? · 12 min
• Convexity and The Principle of Duality · 10 min
• Convex Optimization Basics · 22 min
• Convex problems · 3 min
• Convex Sets | Introduction, Definition and Examples · 6 min
• Understanding Concave and Convex Functions · 22 min
• The Karush–Kuhn–Tucker (KKT) Conditions and the Interior Point Method for Convex Optimization · 22 min

All courses