Sign inSign in
ConceptEngineering

Primal-dual interior-point methods

Optimization methods that update primal and dual variables at each iteration without inner and outer iteration distinctions.
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.

Barrier method1KKT conditions1Newton directions1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    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.