Optimal transport: discretization and algorithms
From MaRDI portal
Publication:2235779
Recommendations
- Computational optimal transport. With applications to data sciences
- Optimal transport on discrete domains
- Optimal transportation, modelling and numerical simulation
- Convergence of a Newton algorithm for semi-discrete optimal transport
- On the geometry and dynamical formulation of the Sinkhorn algorithm for optimal transport
Cites work
- scientific article; zbMATH DE number 1257371 (Why is no real title available?)
- scientific article; zbMATH DE number 2133741 (Why is no real title available?)
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A new algorithm for the assignment problem
- A new optimal transport distance on the space of finite Radon measures
- A numerical algorithm for \(L_2\) semi-discrete optimal transport in 3D
- A numerical method for the elliptic Monge-Ampère equation with transport boundary conditions
- A numerical method to solve multi-marginal optimal transport problems with Coulomb cost
- A primer on generated Jacobian equations: geometry, optics, economics
- A sparse multiscale algorithm for dense optimal transport
- A texture synthesis model based on semi-discrete optimal transport in patch space
- An algorithm for optimal transport between a simplex soup and a point cloud
- An interpolating distance between optimal transport and Fisher-Rao metrics
- An iterative scheme for solving the optimal transportation problem
- An optimization problem for mass transportation with congested dynamics
- Approximation algorithms for bipartite matching with metric and geometric costs
- Assignment Problems
- Augmented Lagrangian methods for transport optimization, mean field games and degenerate elliptic equations
- Barycenters in the Wasserstein space
- Concerning nonnegative matrices and doubly stochastic matrices
- Convergence of a Newton algorithm for semi-discrete optimal transport
- Convex Analysis
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Density functional theory and optimal transportation with Coulomb cost
- Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure
- Discretization of the 3D Monge-Ampere operator, between wide stencils and power diagrams
- Dual coordinate step methods for linear network flow problems
- Earth mover's distances on discrete surfaces
- Eulerian models and algorithms for unbalanced optimal transport
- Far-field reflector problem and intersection of paraboloids
- Faster Scaling Algorithms for Network Problems
- Free boundaries in optimal transport and Monge-Ampère obstacle problems
- Geometry helps to compare persistence diagrams
- Gradient flows in metric spaces and in the space of probability measures
- Iterative Bregman projections for regularized transportation problems
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport
- Minimal convex extensions and finite difference discretisation of the quadratic Monge-Kantorovich problem
- Minimal geodesics on groups of volume-preserving maps and generalized solutions of the Euler equations
- Minkowski-type theorems and least-squares clustering
- Mixed \(L^2\)-Wasserstein optimal mapping between prescribed density functions
- Monge-Kantorovich depth, quantiles, ranks and signs
- Multi-marginal optimal transport: theory and applications
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- On Hölder continuity-in-time of the optimal transport map towards measures along a curve
- On the design of a reflector antenna. II
- On the local theory of prescribed Jacobian equations
- 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
- On the numerical solution of the far field refractor problem
- On the optimal map in the 2-dimensional random matching problem
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal transport with proximal splitting
- Polar factorization and monotone rearrangement of vector‐valued functions
- Power particles: an incompressible fluid solver based on power diagrams
- Semidual regularized optimal transport
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- The Monge-Ampère equation
- The Monge–Kantorovitch mass transfer and its computational fluid mechanics formulation
- The Variational Formulation of the Fokker--Planck Equation
- The earth mover's distance as a metric for image retrieval
- The geometry of optimal transportation
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Variational principles for Minkowski type problems, discrete optimal transport, and discrete Monge-Ampère equations
- Vector quantile regression: an optimal transport approach
- Weak solutions of one inverse problem in geometric optics
Cited in
(26)- Entropic approximation of \(\infty \)-optimal transport problems
- Discrete Optimal Transport with Independent Marginals is #P-Hard
- Asymptotics for semidiscrete entropic optimal transport
- Discrete Wasserstein barycenters: optimal transport for discrete data
- Minimizing optimal transport for functions with fixed-size nodal sets
- Multivariate ranks and quantiles using optimal transport: consistency, rates and nonparametric testing
- Topological optimization and optimal transport in the applied sciences
- Optimal transport: discretization and algorithms
- Intrinsic sparsity of Kantorovich solutions
- A simple method for the optimal transportation
- scientific article; zbMATH DE number 1975241 (Why is no real title available?)
- A damped Newton algorithm for generated Jacobian equations
- An efficient algorithm for matrix-valued and vector-valued optimal mass transport
- Asymptotic optimality of the triangular lattice for a class of optimal location problems
- Regularization for Wasserstein distributionally robust optimization
- Semi-discrete optimal transport methods for the semi-geostrophic equations
- On the geometry and dynamical formulation of the Sinkhorn algorithm for optimal transport
- Generalized unnormalized optimal transport and its fast algorithms
- Metasurfaces and optimal transport
- A new implementation of the geometric method for solving the Eady slice equations
- Sensitivity analysis and tailored design of minimization diagrams
- Data-driven optimal transport
- Lagrangian Discretization of Variational Mean Field Games
- Entropic optimal transport solutions of the semigeostrophic equations
- Optimal transport on discrete domains
- A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid
This page was built for publication: Optimal transport: discretization and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2235779)
