Sign inSign in
ConceptEngineering

Interior point method

Algorithms that travel inside the feasible set rather than around the edges to solve optimization problems.
as Gilbert Strang defines itMITThe wording closest to all 3 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Stephen Boyd

    Stanford University · Undergraduate

    An optimization method whose computational cost is dominated by forming the Hessian matrix, taking approximately MN2MN^2 operations per step.
    • 38:33Geometric Problems Continued
    • 30:02Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps

Lectures that assume it

4

Connections

17

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

2 lecturers. 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.