Stanford EE364A Convex Optimization I Stephen Boyd I 2023 I Lecture 8

Transcript

We'll continue on duality which is this actually super interesting topic. And what we've seen so far, just to remind you, is we take any optimization problem at all, convex or not, and we form this thing called the Lagrangian. And you can mumble about what's the Lagrangian. You go, well, it's a way to incorporate the constraints into the objective.... Read More