ConceptEngineering
Iterated weighted L1 heuristic
A heuristic method for cardinality minimization that repeatedly solves a weighted L1 norm problem, updating weights inversely proportional to the absolute values from the previous iteration.
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.