ConceptEngineering
Polytope
A geometric object with flat sides formed by the intersection of half-spaces defined by linear inequalities.
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
2Each in their own terms, from the easiest level.
Russ Tedrake
A bounded polyhedron defined by a set of linear inequality constraints.
Lectures that assume it
10- Relaxing Integer Linear Programs to Linear Programs: Bipartite Maximum Perfect Matching
- Hard Lefschetz Theorem and Hodge-Riemann Relations for Combinatorial Geometries
- Complexity of Lasso with Normalized Data
- Scattering Amplitudes and Dualities at Infinity: Part 2
- Linear Programming: Optimization Reduces to Feasibility
- The Ellipsoid Algorithm
- Matroids and the Integral Hodge Conjecture for Abelian Varieties
- Algebraic Geometry and Discrete Periodic Operators
- Latent Variable models and Subset Smoothing
- The Hilbert–Einstein Functional and the Sasaki–Futaki Invariant
Connections
19The lectures that define it or assume it, and the concepts next to it.
Concepts7
Show 1 moreShow fewer
Lectures12
- Street Fighting Mathematics
- Robust Control & Policy Search
- Relaxing Integer Linear Programs to Linear Programs: Bipartite Maximum Perfect Matching
- Hard Lefschetz Theorem and Hodge-Riemann Relations for Combinatorial Geometries
- Complexity of Lasso with Normalized Data
- Scattering Amplitudes and Dualities at Infinity: Part 2