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
