MGT-418: Convex optimizationThis course introduces the theory and application of modern convex optimization from an engineering perspective. ...
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 prove theorems. ...
MATH-502: Distribution and interpolation spacesThe goal of this course is to give an introduction to the theory of distributions and cover the fundamental results of Sobolev spaces including fractional spaces that appear in the interpolation theory. Those notions are central to the study of partial dif ...
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, marketing, transportation and finance to transform data into ...
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 algorithms to solve constrained and unconstrained problems. ...
MATH-476: Optimal transportThe first part is devoted to Monge and Kantorovitch problems, discussing the existence and the properties of the optimal plan. The second part introduces the Wasserstein distance on measures and develops applications of optimal transport to PDEs, functiona ...
MATH-410: Riemann surfacesThis course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...
MATH-506: Topology IV.a - 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 algebra. We study an algebraic version, namely group coho ...
EE-611: Linear system theoryThe course covers control theory and design for linear time-invariant systems : (i) Mathematical descriptions of systems (ii) Multivariables realizations; (iii) Stability ; (iv) Controllability and Observability; (v) Minimal realizations and coprime fracti ...
MATH-535: Algebraic geometry III - selected topicsThis course is an introduction to intersection theory on algebraic varieties.
An important aim of the course is to develop geometric intuition while using the language of schemes developed in the basic algebraic geometry course, thus building a solid foun ...
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 Maxwell dans le vide et dans des milieux matériels complexe ...
MATH-404: Functional analysis IIWe introduce locally convex vector spaces. As an example we treat the space of test functions and the space of distributions. In the second part of the course, we discuss differential calculus in Banach spaces and some elements from nonlinear functional an ...
MATH-317: Algebra V - Galois theoryGalois theory lies at the interface of Field Theory and Group Theory. It aims to describe the algebraic symmetries of fields. We will focus on Galois theory for finite field extensions and some applications. ...
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 ces techniques au traitement du signal et aux télécommuni ...
PHYS-431: Quantum field theory IThe goal of the course is to introduce relativistic quantum field theory as the conceptual and mathematical framework describing fundamental interactions. ...
CS-412: Software securityThis course focuses on software security fundamentals, secure coding guidelines and principles, and advanced software
security concepts. Students learn to assess and understand threats, learn how to design and implement secure software
systems, and get han ...
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 repertory of basic algorithmic solutions to problems in many ...
