Sign inSign in
ConceptEngineering

Quadratic program

An optimization problem with a quadratic objective function and linear constraints, which can be solved efficiently and reliably.
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 optimization1Convex quadratic functions1Convexity1Linear programming1Polyhedra1

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 problem where a convex quadratic objective function is minimized over a polyhedral feasible set defined by linear inequalities and equalities.
    • 11:51Saddle-Point Interpretation, KKT Conditions & Perturbation

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.