Optimal transport: discretization and algorithms
From MaRDI portal
Publication:2235779
DOI10.1016/bs.hna.2020.10.001OpenAlexW3007691993MaRDI QIDQ2235779
Quentin Mérigot, Boris Thibert
Publication date: 21 October 2021
Full work available at URL: https://arxiv.org/abs/2003.00855
Numerical optimization and variational techniques (65K10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Numerical methods in optimal control (49Mxx) Optimal transportation (49Q22)
Related Items (13)
Multivariate ranks and quantiles using optimal transport: consistency, rates and nonparametric testing ⋮ Asymptotics for Semidiscrete Entropic Optimal Transport ⋮ Lagrangian Discretization of Variational Mean Field Games ⋮ A new implementation of the geometric method for solving the Eady slice equations ⋮ A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid ⋮ Entropic optimal transport solutions of the semigeostrophic equations ⋮ Sensitivity analysis and tailored design of minimization diagrams ⋮ Regularization for Wasserstein distributionally robust optimization ⋮ Asymptotic optimality of the triangular lattice for a class of optimal location problems ⋮ Semi-discrete optimal transport methods for the semi-geostrophic equations ⋮ Intrinsic sparsity of Kantorovich solutions ⋮ Metasurfaces and optimal transport ⋮ A damped Newton algorithm for generated Jacobian equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variational principles for Minkowski type problems, discrete optimal transport, and discrete Monge-Ampère equations
- Vector quantile regression: an optimal transport approach
- Far-field reflector problem and intersection of paraboloids
- A sparse multiscale algorithm for dense optimal transport
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- On the local theory of prescribed Jacobian equations
- An iterative scheme for solving the optimal transportation problem
- Monge-Kantorovich depth, quantiles, ranks and signs
- Weak solutions of one inverse problem in geometric optics
- Augmented Lagrangian methods for transport optimization, mean field games and degenerate elliptic equations
- Free boundaries in optimal transport and Monge-Ampère obstacle problems
- On the numerical solution of the equation \(\frac{\partial ^ 2z\partial ^ 2z}{\partial x^ 2\partial y^ 2}-(\frac{\partial ^ 2z}{\partial x\partial y})^ 2=f\) and its discretizations. I
- Dual coordinate step methods for linear network flow problems
- The geometry of optimal transportation
- Minkowski-type theorems and least-squares clustering
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- A new optimal transport distance on the space of finite Radon measures
- An interpolating distance between optimal transport and Fisher-Rao metrics
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- The earth mover's distance as a metric for image retrieval
- On the design of a reflector antenna. II
- Convergence of a Newton algorithm for semi-discrete optimal transport
- On the optimal map in the 2-dimensional random matching problem
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- On the numerical solution of the far field refractor problem
- Concerning nonnegative matrices and doubly stochastic matrices
- Power particles
- Convolutional wasserstein distances
- Optimal Transport with Proximal Splitting
- A Numerical Method for the Elliptic Monge--Ampère Equation with Transport Boundary Conditions
- On Hölder continuity-in-time of the optimal transport map towards measures along a curve
- Barycenters in the Wasserstein Space
- Discretization of the 3d monge−ampere operator, between wide stencils and power diagrams
- A Numerical Algorithm forL2Semi-Discrete Optimal Transport in 3D
- Eulerian models and algorithms for unbalanced optimal transport
- Multi-marginal optimal transport: Theory and applications
- Assignment Problems
- An Optimization Problem for Mass Transportation with Congested Dynamics
- Minimal geodesics on groups of volume-preserving maps and generalized solutions of the Euler equations
- A new algorithm for the assignment problem
- Polar factorization and monotone rearrangement of vector‐valued functions
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The Variational Formulation of the Fokker--Planck Equation
- Semidual Regularized Optimal Transport
- Geometry Helps to Compare Persistence Diagrams
- Earth mover's distances on discrete surfaces
- An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud
- Faster Scaling Algorithms for Network Problems
- The Monge–Kantorovitch mass transfer and its computational fluid mechanics formulation
- Density Functional Theory and Optimal Transportation with Coulomb Cost
- A Primer on Generated Jacobian Equations: Geometry, Optics, Economics
- A Texture Synthesis Model Based on Semi-Discrete Optimal Transport in Patch Space
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Minimal convex extensions and finite difference discretisation of the quadratic Monge–Kantorovich problem
- Iterative Bregman Projections for Regularized Transportation Problems
- Approximation algorithms for bipartite matching with metric and geometric costs
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A Numerical Method to Solve Multi-Marginal Optimal Transport Problems with Coulomb Cost
- Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport
- Convex Analysis
- The Monge-Ampère equation
- Mixed \(L^2\)-Wasserstein optimal mapping between prescribed density functions
This page was built for publication: Optimal transport: discretization and algorithms
