Sign inSign in
ConceptEngineering

Finding a point in the intersection of convex sets

Finding a point in the intersection of multiple closed convex sets by minimizing the maximum distance to all of them.
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.

Convex sets1Subgradient1

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.