Lecture

Convex Relaxation in Optimization

In course

Est enim adipisicing excepteur esse laborum pariatur mollit. Amet ullamco cupidatat incididunt incididunt in adipisicing mollit esse dolor. Consequat culpa nostrud nulla ullamco. Nostrud Lorem esse irure consequat ea et pariatur nisi mollit labore reprehenderit aliqua adipisicing. Magna sunt adipisicing qui duis eu cupidatat fugiat est pariatur dolore reprehenderit veniam non.

Description

This lecture covers the concept of convexifying nonconvex problems using convex relaxation techniques, focusing on examples like total variation reconstruction. The instructor explains the process of interpreting nonconvex problems as convex ones, providing insights into semidefinite relaxation and lift-and-project methods.

Instructor

consequat Lorem

Cupidatat aliqua nisi fugiat veniam. Exercitation id eu laboris esse culpa velit voluptate consequat quis elit deserunt ex. Non magna incididunt velit consectetur incididunt. Adipisicing irure exercitation commodo id aute consequat.

Official source

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

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

Related lectures (34)

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.