Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Optimal Transport: Convex Analysis
Graph Chatbot
Related lectures (46)
Polynomial Optimization: SOS and SDP
Log in to Mediaspace to watch this video
Explores Sum of Squares polynomials and Semidefinite Programming in Polynomial Optimization, enabling the approximation of non-convex polynomials with convex SDP.
Linear and Integer Programming
Log in to Mediaspace to watch this video
Covers the theory of linear and integer programming, focusing on the integer hull and rational polyhedra.
Lagrangian Duality: Convex Optimization
Log in to Mediaspace to watch this video
Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.
Convex Relaxation: Negative Type Theorems
Log in to Mediaspace to watch this video
Explores convex relaxation and negative type theorems in convex programs.
Convex Hulls: Complexity and Vertices
Log in to Mediaspace to watch this video
Explores the complexity of convex hulls and the concept of vertices within them.
Optimal Transport: Theory and Applications
Log in to Mediaspace to watch this video
Explores the theory of optimal transport, focusing on Lipschitz functions and uniqueness of solutions.
Previous
Page 3 of 3
Next