Lecture 1 | Convex Optimization I (Stanford)

Channel:Stanford · Length:1:20:32 · Published:2008-07-09 · Views:754817

Watch on YouTube

Summary

The introductory lecture of Stephen Boyd's Stanford Convex Optimization I course (EE 364A). It outlines convex sets, functions and problems, and the course's coverage of least-squares, linear and semidefinite programming, duality and interior-point methods.

Why HN recommends it

HN recommends Boyd's lectures as a fantastic, often funny follow-up to linear algebra and as a step in machine learning study paths.

These lectures are fantastic after you've mastered the basics of linear algebra — HN, 2022

Pure mathematics · Math & theory (other) · University lectures & courses

Subtitles (excerpt)

this presentation is delivered by the Stanford center for professional development okay I guess I guess we're on uh welcome to 364a which is is uh convex optimization one um unfortunately I have to start class by apologizing uh if you're watching this um not in real time I guess you'd say I don't know I don't know how you describe that if you're watching this at the scheduled time of the class then you'll notice that I'm not there um that's because I'm in India it gets very you can actually get very confused doing this um there's actually one more one more confusing thing than this and that's when you tape ahead of class uh before or that actually is is goes after a class you haven't given yet that gets very complic well we're not going to go there let's uh Le let's move on so uh it I'm sorry to miss the first day of the class um as I said I'm I'm in India or or will be or depending on where the the time reference is um that's very tacky I've never done it before so this is a first actually we're uh we're going to have some we're going to make a lot of first today I believe we may be making scpd history because we're taping ahead this lecture not only the quarter before but the year before calendar

On Hacker News

These lectures are fantastic after you've mastered the basics of linear algebra [VIDEO] (convex optimization, by a very experienced and often funny lecturer) — natly, 2022-05
This is my favorite way to think about it as well. I think I learned it first in one of Steven Boyds astounding convex optimization lectures [VIDEO] — hwers, 2022-01
A practical math topic I think all computer science (and engineering, really) students should take is convex optimization. Often a problem in engineering or computer science can be phrased as minimizing a cost function over some data and/or variable constraints. Take SVM for example, or sparse signal denoising, or template matching. And far too often, people will apply "advanced state of the art … — zxcvvcxz, 2015-04
First, finish lectures by Professor Gilbert Strang. [LINK] To my memory, session notes of CS229 is good enough for understanding SVM and gaussian distributions. Also watch youtube videos. [LINK] [LINK] If you just want to use the libraries, you can stop here. If you want to know more, read chapters 1-3 of nonlinear programming by Professor Dimitri Bertsekas before convex optimization. [LINK] Then… — wcsun, 2011-06

Related videos