ConceptEngineering
Universally approximate
The ability of a data structure to bound any arbitrary convex set using outer approximations that shrink within it.
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 sets1Data structures in optimization1
Lecturers
1Connections
1The lectures that define it or assume it, and the concepts next to it.