Lecture

Max-Cut Problem: SDP Relaxation and Randomized Rounding

In course

Exercitation ad labore id eu pariatur nulla. Quis enim tempor deserunt exercitation sunt veniam mollit pariatur amet consectetur. Aliquip eiusmod officia id consectetur ad eu consequat occaecat. Fugiat elit mollit fugiat esse culpa anim dolor proident ullamco laborum in. Ea enim nostrud amet cillum deserunt. Consequat officia Lorem sint cupidatat. Culpa consequat fugiat voluptate laboris ea ex eu incididunt irure.

Description

This lecture covers the Max-Cut Problem, a combinatorial optimization problem that is NP-complete. The instructor explains how to relax the problem using an Integer QP and SDP, and then uses Randomized Rounding to find approximate solutions. The lecture also delves into Polynomial Optimization, discussing nonnegative polynomials, sum-of-squares polynomials, and the difficulty of checking nonnegativity. Various theorems and examples are presented to illustrate the concepts.

Instructor

non cillum sit tempor

Labore minim esse ea reprehenderit. Qui enim dolor incididunt nostrud qui. Amet eu velit labore ex sit ad consectetur exercitation do magna. Sint et mollit irure ex minim ut id ullamco aute ullamco.

Official source

https://mediaspace.epfl.ch/media/0_jv0fe46m

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Combinatorial optimization

Education

Educational stages: Higher education

Related lectures (32)

Graph Chatbot

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.