Sign inSign in

Ellipsoid algorithm

An algorithm that solves linear programs in polynomial time.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 4 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.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    An algorithm that can solve linear programs in polynomial time given a separation oracle.
    • 16:24The Semidefinite Programming Relaxation for Max-Cut
  • Stephen Boyd

    Stanford University · Graduate

    An algorithm for minimizing a convex function by localizing the optimal point in an ellipsoid and iteratively refining it using subgradients and minimum volume enclosing ellipsoids.
    • 41:36Convex Optimization II: Analytic Center Cutting-Plane and Ellipsoid Methods
  • Santosh Vempala

    Georgia Institute of Technology · Research

    An algorithm that solves convex optimization and separation problems in polynomial time using a sequence of shrinking ellipsoids.
    • 10:24A Nearly Quadratic Lower Bound for Linear Optimization over Convex Bodies

Lectures that assume it

1

Connections

10

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.