ConceptEngineering
Minimum cardinality problem
The problem of finding the sparsest vector x inside a convex set C by minimizing the cardinality of x.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.