ConceptEngineering
Kelly's cutting-plane method
An algorithm that builds a piecewise-linear approximation of a convex function by iteratively querying points and adding cutting planes to form a tighter lower bound.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.