Sign inSign in
ConceptEngineering

Minimum cardinality relaxation heuristic

A heuristic method for finding a sparse solution by relaxing the problem and taking the cardinality of the solution as an upper bound.
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.

LP relaxation1Mixed boolean LP1

Lecturers

1

    Connections

    2

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

    Concept1

    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.