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
Separation Theorem: Convex Sets
Graph Chatbot
Related lectures (31)
Previous
Page 1 of 4
Next
Diophantine Approximation: Minbowski's Theorem
Covers Minbowski's Theorem on Diophantine Approximation and Gram-Schmidt orthogonalization.
Convex Optimization: Convex Functions
Covers the concept of convex functions and their applications in optimization problems.
Optimal Transport: Rockafellar Theorem
Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.
Convex Optimization: Gradient Descent
Explores VC dimension, gradient descent, convex sets, and Lipschitz functions in convex optimization.
Geodesic Convexity: Theory and Applications
Explores geodesic convexity in metric spaces and its applications, discussing properties and the stability of inequalities.
Compact Embedding: Theorem and Sobolev Inequalities
Covers the concept of compact embedding in Banach spaces and Sobolev inequalities.
Banach Spaces: Reflexivity and Convergence
Explores Banach spaces, emphasizing reflexivity and sequence convergence in a rigorous mathematical framework.
Optimal Transport: Theory and Applications
Explores Lagrange multipliers, minimax theorems, and convex subsets in optimal transport theory.
KKT and Convex Optimization
Covers the KKT conditions and convex optimization, discussing constraint qualifications and tangent cones of convex sets.
Convex Sets: Theory and Applications
Explores convex sets, their properties, and applications in optimization.