Course

MATH-632: Semidefinite Optimization and Applications to Geometric and Combinatorial Problems

Summary

This course covers the following topics: Introduction to conic optimization, Duality in conic programming, Sums of squares/ SemideFinite relaxation for independence number and chromatic number, Harmonic analysis on [owe, sets, Lasserre's hierarchy, Packing on the sphere

Lectures

Instructor

Maryna Viazovska

Maryna Viazovska did her bachelor studies at the Kyiv National Taras ShevchenkoUniversity and completed her MSc at the Technical University Kaiserslautern.She obtained her PhD in 2013 in Bonn.She was a postdoctoral researcher at the Institut des Hautes Etudes Scientifiquesand at the Humboldt University of Berlin, and in 2017 was a Minerva DistinguishedVisitor at Princeton University. She joined EPFL in 2017 as Tenure-Track AssistantProfessor and was promoted Full Professor in 2018.

Official source

https://edu.epfl.ch/coursebook/en/semidefinite-optimization-and-applications-to-geometric-and-combinatorial-problems-MATH-632

Moodle Page

http://go.epfl.ch/MATH-632

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Summary

Lectures

Instructor

Maryna Viazovska

Official source

https://edu.epfl.ch/coursebook/en/semidefinite-optimization-and-applications-to-geometric-and-combinatorial-problems-MATH-632

Moodle Page

http://go.epfl.ch/MATH-632

About this result

Related courses (29)

CS-450: Algorithms II

A 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 ...

EE-556: Mathematics of data: from theory to computation

This course provides an overview of key advances in continuous optimization and statistical analysis for machine learning. We review recent learning formulations and models as well as their guarantees

MATH-512: Optimization on manifolds

We develop, analyze and implement numerical algorithms to solve optimization problems of the form min f(x) where x is a point on a smooth manifold. To this end, we first study differential and Riemannian geometry (with a focus dictated by computational con ...

MATH-261: Discrete optimization

This 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. ...

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...