Lecture

Convex Geometry: Brunn-Minkowski Inequality

Related lectures (30)

Hamiltonian dynamics on convex polytopes

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

Geodesic Convexity: Theory and Applications

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

Convex Optimization

Covers an overview of convex optimization, affine sets, polyhedra, ellipsoids, and convex functions.

Optimal Transport: Rockafellar Theorem

Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.

Convex Sets: Theory and Applications

Explores convex sets, their properties, and applications in optimization.

Convex Bodies: Properties and Theorems

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

Trade-offs in Data and Time

Explores trade-offs between data and time in computational problems, emphasizing diminishing returns and continuous trade-offs.

Optimal Transport: Gradient Flows in Rd

Explores optimal transport and gradient flows in Rd, emphasizing convergence and the role of Lipschitz and Picard-Lindelöf theorems.

Convex Optimization: Gradient Descent

Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.

Convex Optimization: Elementary Results

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

KKT and Convex Optimization

Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.

Geodesically Convex Optimization

Covers geodesically convex optimization on Riemannian manifolds, exploring convexity properties and minimization relationships.

Convexity: Functions and Global Minima

Explores convex functions, global minima, and their relationship with differentiability.

Linear Programming Basics

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

Optimization with Constraints: KKT Conditions

Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.

Regular Polyhedra: Definitions and Symmetries

Explores the definitions and symmetries of regular polyhedra, focusing on the five known convex regular polyhedra from ancient times.

Convex Sets: Mathematical Optimization

Introduces convex optimization, covering convex sets, solution concepts, and efficient numerical methods in mathematical optimization.

Convex Optimization: Sets and Functions

Introduces convex optimization through sets and functions, covering intersections, examples, operations, gradient, Hessian, and real-world applications.

The Hidden Convex Optimization Landscape of Deep Neural Networks

Explores the hidden convex optimization landscape of deep neural networks, showcasing the transition from non-convex to convex models.

Optimal Transport: Convexity and Inequalities

Explores optimal transport, emphasizing convexity properties and inequalities in compact sets.