Sign inSign in
ConceptEngineering

L1-norm heuristic

A heuristic method that replaces cardinality functions with the l1-norm to approximate sparse solutions in convex optimization.
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 optimization1L1 norm1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.