Sign inSign in
ConceptEngineering

Second-order cone programming

An optimization problem that minimizes a linear objective function subject to second-order cone constraints.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Russ Tedrake

    MIT · Graduate

    Second-order cone programming adds cone-shaped constraints to linear objectives and linear constraints.
    • 34:42Computing Lyapunov Functions I

Connections

6

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.