北京雁栖湖应用数学研究院 北京雁栖湖应用数学研究院

  • 关于我们
    • 院长致辞
    • 理事会
    • 协作机构
    • 参观来访
  • 人员
    • 管理层
    • 科研人员
    • 博士后
    • 来访学者
    • 行政团队
    • 学术支持
  • 学术研究
    • 研究团队
    • 公开课
    • 讨论班
  • 招生招聘
    • 教研人员
    • 博士后
    • 学生
  • 会议
    • 学术会议
    • 工作坊
    • 论坛
  • 学院生活
    • 住宿
    • 交通
    • 配套设施
    • 周边旅游
  • 新闻
    • 新闻动态
    • 通知公告
    • 资料下载
关于我们
院长致辞
理事会
协作机构
参观来访
人员
管理层
科研人员
博士后
来访学者
行政团队
学术支持
学术研究
研究团队
公开课
讨论班
招生招聘
教研人员
博士后
学生
会议
学术会议
工作坊
论坛
学院生活
住宿
交通
配套设施
周边旅游
新闻
新闻动态
通知公告
资料下载
清华大学 "求真书院"
清华大学丘成桐数学科学中心
清华三亚国际数学论坛
上海数学与交叉学科研究院
河套数学与交叉学科研究院
BIMSA > Optimal transport
Optimal transport
The topic of optimal transport goes back to XVIII century, but the last years have witnessed rapid progress in the field, and new emerging applications to the variety of different areas including mathematical finance, geometry, AI, statistics, and engineering.

We will cover basic notions and principles — the existence and uniqueness of optimal transport maps, the Kantorovich duality, cyclical monotonicity, the Brenier theorem, Wasserstein spaces. We will pay special attention to the Wasserstein 1-space and present the related needle decomposition and its applications in geometry. If time and the class interest permits, we will also cover Wasserstein gradient flows.
讲师
Krzysztof Ciosmak
日期
2026年03月05日 至 05月28日
位置
Weekday Time Venue Online ID Password
周四,周五 09:50 - 11:25 Shuangqing ZOOM 02 518 868 7656 BIMSA
网站
https://sites.google.com/view/kciosmak/teaching/optimal-transport
修课要求
An understanding of real analysis, with basic measure theory, and of probability theory are prerequisites for the course. Acquaintanceship with convex analysis concepts such as duality, will be an advantage. Some examples may involve PDEs, so knowledge of the PDE theory will be beneficial, but not necessary.
课程大纲
W1 March 5,6. Definition of the problem. Examples. Transport maps and transport plans. Kantorovich relaxation. One-dimensional problem.
W2: March 12, 13. Kantorovich duality. Existence of optimal plans.
W3: March 19, 20. Cyclical monotonicity as sufficient and necessary condition for optimality. c-cyclical monotone sets, c-subdifferentials, existence of optimal transport maps.
W4: March 26, 27. Brenier theorem for quadratic cost.
W5: April 2, 3. Optimal trasnport for the linear cost. Transport rays, Lipschitz potentials, needle
decomposition.
W6: April 9, 10. Optimal trasnport for the linear cost. Transport rays, Lipschitz potentials, needle
decomposition.
W7: April 16, 17. Wasserstein distances.
W8: April 23, 24. Displacement interpolation and displacement convexity.
W9: April 30. Applications: geometric inequalities.
W10: May 7, 8. Applications: geometric inequalities continued.
W11: May. 14, 15. The Monge-AmpÅLere equation.
W12: May. 21, 22. Gradient flows.
W13: May. 28. Gradient flows continued.
参考资料
References: Topics in Optimal Transportation by Villani
Optimal Transport for Applied Mathematicians by Santambrogio
Optimal Mass Transportation on Euclidean Spaces by Maggi

Supplementary references: Optimal Transport: Old and New by VillaniGradient Flows in Metric Spaces and in the Space
of Probability Measures by Ambrosio, Gigli, Savare
Mass Transportation Problems vol. 1 & 2 by Rachev, Ruschendorf
An Invitation to Optimal Transport, Wasserstein Distances, and Gradient Flows by Figalli, Glaudo
Lectures on Optimal Transport by Ambrosio, Brue, Semola
听众
Advanced Undergraduate , Graduate , 博士后 , Researcher
视频公开
公开
笔记公开
不公开
语言
英文
讲师介绍
After graduating from the University of Warsaw, Krzysztof Ciosmak joined the Mathematical Institute of the University of Oxford, where he defended my doctoral thesis on Optimal transport and 1-Lipschitz maps, and subsequently held a postdoctoral position. Before joining BIMSA, he held the Fields-Ontario Postdoctoral Fellowship at the University of Toronto and the Fields Institute.
北京雁栖湖应用数学研究院
CONTACT

No. 544, Hefangkou Village Huaibei Town, Huairou District Beijing 101408

北京市怀柔区 河防口村544号
北京雁栖湖应用数学研究院 101408

Tel. 010-60661855 Tel. 010-60661855
Email. administration@bimsa.cn

版权所有 © 北京雁栖湖应用数学研究院

京ICP备2022029550号-1

京公网安备11011602001060 京公网安备11011602001060