ConceptMathematics
Optimization problems
Problems where we want to find the minimum or maximum of a function of several variables.
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
1Lectures that assume it
18The first 12 are shown.
- Quantum Computing and the Entanglement Frontier
- Course Overview, Interval Scheduling
- Complexity: Fixed-Parameter Algorithms
- Geometric Problems Continued
- Lagrange Duality, Dual Decomposition & Generalized Inequalities
- Exploration of advanced topics in deep reinforcement learning
- Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- Convex Optimization II: Primal and Dual Decomposition Methods
- Sequential Convex Programming
- Mathematical Optimization & Why Convexity Is the Watershed
- AI in Science and Engineering: Towards Trustworthy AI and Quantum Technologies
- Approximation Algorithms: Traveling Salesman Problem
Connections
25The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures19
- Max-Min Problems; Least Squares
- Quantum Computing and the Entanglement Frontier
- Course Overview, Interval Scheduling
- Complexity: Fixed-Parameter Algorithms
- Geometric Problems Continued
- Lagrange Duality, Dual Decomposition & Generalized Inequalities
Show 13 moreShow fewer
- Exploration of advanced topics in deep reinforcement learning
- Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- Convex Optimization II: Primal and Dual Decomposition Methods
- Sequential Convex Programming
- Mathematical Optimization & Why Convexity Is the Watershed
- AI in Science and Engineering: Towards Trustworthy AI and Quantum Technologies
- Approximation Algorithms: Traveling Salesman Problem
- Stochastic Gradient Descent
- Min-st-Cut is the Dual LP of Max-st-Flow
- The Sum-of-Squares (SOS) Proof System
- Genetic Algorithms: MIT Artificial Intelligence
- Least-Norm Solutions of Underdetermined Equations
- Beyond Worst-Case Analysis