#483 overall
Convex Optimization
edX (Stanford Online)
1 recommender · 1 thread · recommended in 1 year, 2021 · score 1.0
A Stanford Online course on convex optimization, taught by Stephen Boyd, covering convex sets and functions, duality, and algorithms for solving convex optimization problems.
Commenters call Boyd's lectures a fantastic, free introduction and praise him as a great lecturer.
Mathematicsintermediatefreevideo lectures#convex optimization#duality#boyd#stanford#linear programming
Recommendations by year
20062026
Context: This is an front-page article on the New York Times about Karmarkar's polynomial time Linear Programming algorithm [1].
I found it amusing. Imagine an article about theoretical computer science making it to the front page of NYT today!
Aside: I learned about this from the first lecture in Boyd's fantastic course on Convex Optimization, which is available for free online [2]. Very excited for this, he's a great lecturer :)
[1] https://en.wikipedia.org/wiki/Karmarkar%27s_algorithm [2] https://learning.edx.org/course/course-v1:StanfordOnline+SOE...