MATH-261: Discrete optimizationThis course is an introduction to linear and discrete optimization.
Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to p
MATH-726: Working group in Topology IThe theme of the working group varies from year to year. Examples of recent topics studied include: Galois theory of ring spectra, duality in algebra and topology, and topological algebraic geometry.
MATH-726(2): Working group in Topology IIThe theme of the working group varies from year to year. Examples of recent topics studied include: Galois theory of ring spectra, duality in algebra and topology, topological algebraic geometry and t
MGT-418: Convex optimizationThis course introduces the theory and application of modern convex optimization from an engineering perspective.
MGT-483: Optimal decision makingThis course introduces the theory and applications of optimization. We develop tools and concepts of optimization and decision analysis that enable managers in manufacturing, service operations, marke
MATH-436: Homotopical algebraThis course will provide an introduction to model category theory, which is an abstract framework for generalizing homotopy theory beyond topological spaces and continuous maps. We will study numerous
MATH-506: Topology IV.b - cohomology ringsSingular cohomology is defined by dualizing the singular chain complex for spaces. We will study its basic properties, see how it acquires a multiplicative structure and becomes a graded commutative a
MATH-670: The theta correspondenceIn the course we will discuss some introductory aspects of the local/global theta correspondence for automorphic forms/representation for various dual pairs. One of the objectives will be to prove Wal
EE-201: Electromagnetics II : field computationCe cours traite de l'électromagnétisme dans le vide et dans les milieux continus. A partir des principes fondamentaux de l'électromagnétisme, on établit les méthodes de résolution des équations de Max
MATH-329: Continuous optimizationThis course introduces students to continuous, nonlinear optimization. We study the theory of optimization with continuous variables (with full proofs), and we analyze and implement important algorith
CS-450: Algorithms IIA first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a reper
MICRO-310(a): Signals and systems I (for MT)Présentation des concepts et des outils de base pour la caractérisation des signaux ainsi que pour l'analyse et la synthèse des systèmes linéaires (filtres ou canaux de transmission). Application de c
MATH-658: Vanishing cycles and perverse sheavesThis course will explain the theory of vanishing cycles and perverse sheaves. We will see how the Hard Lefschetz theorem can be proved using perverse sheaves. If we have more time we will try to see t
FIN-414: Optimization methodsThis course presents the problem of static optimization, with and without (equality and inequality) constraints, both from the theoretical (optimality conditions) and methodological (algorithms) point
