Sign inSign in
ConceptEngineering

Polishing

A post-processing step where the sparsity pattern found by an l1l_1 heuristic is fixed and the convex optimization problem is re-solved to obtain a final heuristic solution.
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.

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.