Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Diophantine Approximation: Minbowski's Theorem
Graph Chatbot
Related lectures (30)
Previous
Page 1 of 3
Next
Optimal Transport: Rockafellar Theorem
Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.
Geodesic Convexity: Theory and Applications
Explores geodesic convexity in metric spaces and its applications, discussing properties and the stability of inequalities.
Separation Theorem: Convex Sets
Explores the Second Separation Theorem for closed convex sets and the concept of supporting hyperplanes.
Minkowski's Theorems: Lattices and Volumes
Explores Minkowski's theorems on lattices, volumes, and set comparisons.
Convex Optimization: Gradient Descent
Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.
Cartesian Product and Induction
Introduces Cartesian product and induction for proofs using integers and sets.
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Convex Optimization: Convex Functions
Covers the concept of convex functions and their applications in optimization problems.
Gaussian Corelation Inequality & Anderson's Thum
Explores Gaussian corelation inequality, Anderson's theorem, and log-concavity in probability theory.
Hermite Normal Form: Computation & Properties
Covers the computation and properties of the Hermite Normal Form (HNF) in matrix theory and lattice theory.