Opening Gradient Descent: Downhill to a Minimum
Gradient Descent: Downhill to a Minimum
- Length
- 53 min
- Level
- Undergraduate
- Recorded
- MIT2019
Chapter 1 of 8: Before the lecture
MIT 18.065 session 22 covers gradient descent at the undergraduate level, showing how first derivatives guide each step toward a minimum. Strang uses the Hessian to test convexity and compares exact and backtracking line searches for choosing a step size.

Your comment is kept while you sign up.Sign in
Analyzes gradient descent on a pure quadratic bowl to show how matrix condition numbers control convergence speed.
MIT 18.065 session 22 covers gradient descent at the undergraduate level, showing how first derivatives guide each step toward a minimum. Strang uses the Hessian to test convexity and compares exact and backtracking line searches for choosing a step size.
Convex Optimization
This lecture
Lecture 22 of 34 of Matrix Methods in Data Analysis, Signal Processing, and Machine Learning.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.