Concept

Carathéodory's theorem (convex hull)

Related lectures (32)

Hamiltonian dynamics on convex polytopes

Explores Hamiltonian dynamics on convex polytopes, covering symplectic capacities, EHZ capacity, and systolic ratio maximizers.

Convex Hulls: Complexity and Vertices

Explores the complexity of convex hulls and the concept of vertices within them.

Density Matrix: Recap and Bloch 'Ball'

Covers the concept of density matrix and its properties, focusing on statistical mixtures and measurements.

Geodesic Convexity: Theory and Applications

Explores geodesic convexity in metric spaces and its applications, discussing properties and the stability of inequalities.

Integer Programming: Doignon's Theorem

Covers Doignon's theorem in integer programming, stating that a set is minimally infeasible if the removal of any constraint makes it feasible.

Convex Bodies: Properties and Theorems

Covers properties and theorems related to convex bodies and their transformations.

Solving Integer Linear Programs

Covers solving integer linear programs graphically, algorithmically, and through optimization methods.

KKT Conditions: Convex Optimization

Explores KKT conditions in convex optimization, covering dual cones, properties, generalized inequalities, and optimality conditions.

Linear Programming: Convex Hull

Covers MAE regression, convex hull, reformulation advantages, and practical problems with decision variables and constraints.

Composite Convex Minimization

Covers solution methods for composite convex minimization and explores examples like ₁-regularized least squares and phase retrieval.

Simplices

Covers the concept of simplices in delta complexes and explains the standard n-simplex and the ordering of vertices.

Reduced Density Matrices: System+Environment

Covers the concept of density matrices and the system-environment interaction.

Integer Programming: John's Theorem

Explores integer programming, John's Theorem, and the reduction to shortest vector computations in convex bodies.

Bezier Curves: Basics and Properties

Covers the basics of Bezier curves and introduces Bernstein polynomials.

Optimal Decision Making: Integer Programming

Covers integer programming, convex hulls, Gomory cutting planes, and branch and bound methods.

Convex Sets: MGT-418 Lecture

On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.

Bezier Curves II

Covers Bezier curves, de Casteljau Algorithm, properties, derivatives, splines, and end-points.

KKT Conditions: Convex Optimization

Explores the KKT conditions in convex optimization, including dual cones, SDP duality, and convex hulls.

Convex Optimization: Elementary Results

Explores elementary results in convex optimization, including affine, convex, and conic hulls, proper cones, and convex functions.

Linear Programming Basics

Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.