Sign inSign in

Semidefinite programming

A generalization of linear programming where the optimization is over the cone of positive semidefinite matrices.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe 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

3

Each in their own terms, from the easiest level.

  • Russ Tedrake

    MIT · Graduate

    An optimization class featuring a linear objective, linear constraints, and positive semidefinite matrix constraints.
    • 35:18Computing Lyapunov Functions I
  • Nikhil Bansal

    UC Berkeley · Graduate

    A type of mathematical optimization problem where a linear objective function is minimized over the intersection of the cone of positive semidefinite matrices with an affine space.
    • 21:23On the Komlós Conjecture

Lectures that assume it

9

Connections

21

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

3 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.