首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Optimal transport with convex obstacle
Authors:Pierre Cardaliaguet
Institution:a Université de Brest, Laboratoire de Mathématiques, UMR 6205, 6 Av. Le Gorgeu, BP 809, 29238 Brest cedex 3, France
b Université Paris Dauphine, CEREMADE, Place du Maréchal De Lattre De Tassigny, 75775 Paris cedex 16, France
Abstract:We consider the Monge transportation problem when the cost is the squared geodesic distance around a convex obstacle. We show that there exists at least one—and in general infinitely many—optimal transport maps.
Keywords:Monge transport problem  Dynamic formulation  Convex obstacle
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号