Sign inSign in
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.
as Stephen Boyd defines itStanford University
Watch it explained

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.

Cardinality minimization1Convex optimization1Convex-concave procedure1L1 heuristic1L1 norm1

Lecturers

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    Concepts3

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.