ConceptEngineering
Interior point method
Algorithms that travel inside the feasible set rather than around the edges to solve optimization problems.
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.
Stephen Boyd
An optimization method whose computational cost is dominated by forming the Hessian matrix, taking approximately operations per step.
Lectures that assume it
4Connections
17The lectures that define it or assume it, and the concepts next to it.
Concepts10
Lectures7
- Geometric Problems Continued
- Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps
- Linear Programming and Two-Person Games
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Convex Optimization with Abstract Linear Operators
- Convex Optimization II: Analytic Center Cutting-Plane and Ellipsoid Methods