ConceptEngineering
Polyhedron
The solution set of finitely many linear inequalities and equalities.
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.
Linear equalities1Linear inequalities1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Lectures that assume it
10- Lagrange Duality, Dual Decomposition & Generalized Inequalities
- Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- The Lagrangian, Dual Function & Slater's Condition
- Convex Functions — First/Second-Order Conditions & Epigraphs
- From Plato to Plateau: Natural Tilings and Soft Cells
- The Shape of Tiles: Regular and Irregular, Hard and Soft
- Convex Optimization II: Localization and Cutting-Plane Methods
- Convex Optimization II: Analytic Center Cutting-Plane and Ellipsoid Methods
- Robust Control & Policy Search
- A Discussion on Geometrization
Connections
16The lectures that define it or assume it, and the concepts next to it.
Concepts5
Lectures11
- Affine Sets, Convex Sets, Cones & Hyperplanes
- Lagrange Duality, Dual Decomposition & Generalized Inequalities
- Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- The Lagrangian, Dual Function & Slater's Condition
- Convex Functions — First/Second-Order Conditions & Epigraphs
- From Plato to Plateau: Natural Tilings and Soft Cells