ConceptEngineering
Localization algorithm
An iterative method that maintains a polyhedron containing the solution set and refines it at each step using cutting planes.
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.
Convex sets1Cutting-plane oracle1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.