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
Constrained optimization: the basics
Graph Chatbot
Related lectures (23)
Previous
Page 2 of 3
Next
Orthogonality and Least Squares Methods
Explores orthogonality, norms, and distances in vector spaces for solving linear systems.
Graph Sketching: Connected Components
Covers the concept of graph sketching with a focus on connected components.
Holomorphic Functions: Taylor Series Expansion
Covers the basic properties of holomorphic maps and Taylor series expansions in complex analysis.
Correlations of the Liouville function
Explores correlations of the Liouville function along deterministic and independent sequences, covering key concepts and theorems.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Approximation by Smooth Functions
Discusses approximation by smooth functions and the convergence of function sequences in normed vector spaces.
Banach Spaces: Reflexivity and Convergence
Explores Banach spaces, emphasizing reflexivity and sequence convergence in a rigorous mathematical framework.
Optimal Transport: Cyclically Monotone Sets
Covers cyclically monotone sets in optimal transport theory and their properties.
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.
Topology of Riemann Surfaces
Covers the topology of Riemann surfaces, focusing on orientation and orientability.