01
Convex optimisation
Why is convexity the line between easy and hard?
CourseFree
Convex Optimization ↗Stephen Boyd, Stanford
The book and full lecture videos, free from the author.
Applied · Module 15
Optimisation & Numerical Methods
How mathematics is actually executed: approximately, iteratively, and on a machine that cannot represent most numbers.
By the end of this module
You can find the best answer when there is no closed form — which is most of the time.
0%0 / 3 complete
02
Gradient descent and its descendants
Why does the simplest possible algorithm dominate machine learning?
03
Numerical linear algebra and stability
When does correct mathematics give wrong answers on a computer?
Quiz
Not written yet for this module. The lectures above are complete and the module still counts toward your progress.