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
Optimal Transport: Cyclically Monotone Sets
Graph Chatbot
Related lectures (27)
Previous
Page 1 of 3
Next
Convex Functions
Covers the properties and operations of convex functions.
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.
Functions: Definitions and Notations
Covers the generalities of functions, including the definition of an application between sets and the uniqueness of elements in the image set.
Mathematical Analysis: Functions and Composition
Covers the analysis of functions, composition, and mathematical induction.
Restriction, Prolongement et Graphe d'une Fonction
Explains the relationship between two functions through restriction and prolongation, emphasizing the importance of defining a function by its graph.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Composition of Applications in Mathematics
Explores the composition of applications in mathematics and the importance of understanding their properties.
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Riemann Integral: Subdivisions and Volumes
Covers the concept of Riemann integral and volume calculation of closed pavements.