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
Minkowski-Weyl: Convexity and Separation Theorem
Graph Chatbot
Related lectures (30)
Previous
Page 2 of 3
Next
Convex Sets: Theory and Applications
Explores convex sets, their properties, and applications in optimization.
Optimal Transport: Theory and Applications
Explores Lagrange multipliers, minimax theorems, and convex subsets in optimal transport theory.
Compact Embedding: Theorem and Sobolev Inequalities
Covers the concept of compact embedding in Banach spaces and Sobolev inequalities.
Initial Problem Solutions
Covers the description of all solutions of the initial problem and related concepts such as compactness and closure.
Approximation of Zeta Function
Explores the approximation of the zeta function using compact functions and spectral decomposition.
Convex Optimization: Sets and Functions
Introduces convex optimization through sets and functions, covering intersections, examples, operations, gradient, Hessian, and real-world applications.
Minkowski's Theorems: Lattices and Volumes
Explores Minkowski's theorems on lattices, volumes, and set comparisons.
Differential Forms Integration
Covers the integration of differential forms on smooth manifolds, including the concepts of closed and exact forms.
Preliminaries in Measure Theory
Covers the preliminaries in measure theory, including loc comp, separable, complete metric space, and tightness concepts.
Hamiltonian dynamics on convex polytopes
Explores Hamiltonian dynamics on convex polytopes, covering symplectic capacities, EHZ capacity, and systolic ratio maximizers.