Asymptotic analysis of domain decomposition for optimal transport
From MaRDI portal
Publication:2690322
DOI10.1007/s00211-023-01347-xOpenAlexW3170785738MaRDI QIDQ2690322
Ismael Medina, Bernhard Schmitzer, Mauro Bonafini
Publication date: 16 March 2023
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.08084
Numerical optimization and variational techniques (65K10) Decomposition methods (49M27) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational Optimal Transport: With Applications to Data Science
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- From the Schrödinger problem to the Monge-Kantorovich problem
- On the scaling of multidimensional matrices
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- The geometry of optimal transportation
- Domain decomposition for entropy regularized optimal transport
- The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations
- Convergence of a Newton algorithm for semi-discrete optimal transport
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- A parabolic flow toward solutions of the optimal transportation problem on domains with boundary
- Parabolic Optimal Transport Equations on Manifolds
- A Numerical Algorithm forL2Semi-Discrete Optimal Transport in 3D
- Polar factorization and monotone rearrangement of vector‐valued functions
- Minimizing Flows for the Monge--Kantorovich Problem
- A Domain Decomposition Method for the Polar Factorization of Vector-Valued Mappings
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Convergence of Entropic Schemes for Optimal Transport and Gradient Flows
- Optimal Transport
