Lecture

Optimal Transport: Prokhorov Theorem

In course

Cupidatat cillum anim laborum ad et fugiat. Ex deserunt anim qui aliqua ullamco irure in culpa do velit non. Duis consectetur tempor officia qui. Nostrud ex consequat et pariatur tempor quis voluptate dolor in. Ut et est magna incididunt cupidatat culpa fugiat officia labore eiusmod commodo. Sunt et est sint consequat mollit.

Description

This lecture covers the Prokhorov Theorem in the context of Optimal Transport, discussing the concept of relatively compact sets, tightness, and narrow convergence. The instructor explains the conditions for c-cyclical monotonicity and provides a heuristic approach for optimality. The lecture emphasizes the importance of support sets and rigorous definitions in proving optimality conditions.

Official source

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

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

Mathematics

Topology: General topology

Mathematical logic: Set theory

Related lectures (46)

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.