Lecture

Convexifying Nonconvex Problems: MGT-418 Lecture

In course

Occaecat cupidatat pariatur ut esse nisi ex laborum voluptate consequat labore consectetur. Reprehenderit dolore enim anim est sunt aute magna labore. Culpa ipsum consequat aute quis labore aliqua ea eiusmod excepteur velit officia. Commodo tempor dolor culpa incididunt ea non laborum pariatur reprehenderit fugiat et.

Description

This lecture covers the concept of convexifying nonconvex problems using techniques such as the kernel trick, sensitivity interpretation of dual solutions, and nonlinear dimensionality reduction. It explores the optimization problems involved in unfolding k-nearest neighbor graphs and provides insights into the exact solutions of convex-cardinality problems.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

fugiat proident cupidatat

Commodo amet dolore et consectetur do tempor id ut veniam aliqua aliqua duis incididunt deserunt. Cupidatat magna enim exercitation dolor quis fugiat mollit incididunt Lorem irure aute Lorem exercitation. Occaecat non officia aliquip exercitation amet ea veniam velit ipsum. Est ex mollit nisi magna ex Lorem do eu minim est excepteur aute. Aliqua labore adipisicing officia fugiat commodo non et velit mollit ad anim nulla. Do sint voluptate eu mollit.

Official source

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

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

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.