Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

optimization

First-order (tangent-line) characterization of convexity

taught

Taught in

The first-order (tangent-line) characterization of convexity
Optimization
Why convexity rules out bad local minima
Optimization

Requires

convex-functions-and-epigraphs required

Required by

Second-order (Hessian) characterization of convexity required
Subgradients for nonsmooth objectives required

Local knowledge map

Local knowledge map

Click to expand

Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.