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 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
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 theor
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
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
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
MATH-687: Algebraic models for homotopy typesln this course we will develop algebraic and coalgebraic models for homotopy types.
Among other things we will learn about Quillen's and Sullivan's model of rationâl homotopy types and about Mandell's
