Optimal transport with proximal splitting
From MaRDI portal
Abstract: This article reviews the use of first order convex optimization schemes to solve the discretized dynamic optimal transport problem, initially proposed by Benamou and Brenier. We develop a staggered grid discretization that is well adapted to the computation of the optimal transport geodesic between distributions defined on a uniform spatial grid. We show how proximal splitting schemes can be used to solve the resulting large scale convex optimization problem. A specific instantiation of this method on a centered grid corresponds to the initial algorithm developed by Benamou and Brenier. We also show how more general cost functions can be taken into account and how to extend the method to perform optimal transport on a Riemannian manifold.
Recommendations
- A fast approach to optimal transport: the back-and-forth method
- Computation of optimal transport with finite volumes
- Iterative Bregman projections for regularized transportation problems
- A mixed finite element discretization of dynamical optimal transport
- Optimal transport problems regularized by generic convex functions: a geometric and algorithmic approach
Cited in
(94)- Monotone operator theory in convex optimization
- Computations of optimal transport distance with Fisher information regularization
- Perspective functions: properties, constructions, and examples
- An interpolating distance between optimal transport and Fisher-Rao metrics
- Optimal transport over nonlinear systems via infinitesimal generators on graphs
- A parallel method for earth mover's distance
- A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer
- Ground metric learning on graphs
- Quadratically regularized optimal transport
- Domain decomposition for entropy regularized optimal transport
- A multiscale analysis of multi-agent coverage control algorithms
- Data-driven gradient flows
- Semi-discrete optimization through semi-discrete optimal transport: a framework for neural architecture search
- Primal dual methods for Wasserstein gradient flows
- A mixed finite element discretization of dynamical optimal transport
- A mean field game inverse problem
- Optimal perturbations for nonlinear systems using graph-based optimal transport
- A fast approach to optimal transport: the back-and-forth method
- Optimal transport: discretization and algorithms
- Lagrangian schemes for Wasserstein gradient flows
- Computation of optimal transport on discrete metric measure spaces
- On the convergence of augmented Lagrangian method for optimal transport between nonnegative densities
- Sliced and Radon Wasserstein barycenters of measures
- A primal-dual partial inverse algorithm for constrained monotone inclusions: applications to stochastic programming and mean field games
- Stability and experimental comparison of prototypical iterative schemes for total variation regularized problems
- Point spread function field learning based on optimal transport distances
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
- Scaling algorithms for unbalanced optimal transport problems
- scientific article; zbMATH DE number 6668768 (Why is no real title available?)
- Diffeomorphic density matching by optimal information transport
- Convex color image segmentation with optimal transport distances
- Transport between RGB images motivated by dynamic optimal transport
- Entropic approximation of Wasserstein gradient flows
- Preconditioning the augmented Lagrangian method for instationary mean field games with diffusion
- Proximal methods for stationary mean field games with local couplings
- Topological data assimilation using Wasserstein distance
- On the implementation of a primal-dual algorithm for second order time-dependent mean field games with local couplings
- An optimal transport approach for solving dynamic inverse problems in spaces of measures
- On the extremal points of the ball of the Benamou-Brenier energy
- A continuation multiple shooting method for Wasserstein geodesic equation
- Multivariate Monotone Inclusions in Saddle Form
- An unbalanced optimal transport splitting scheme for general advection-reaction-diffusion problems
- Proximal activation of smooth functions in splitting algorithms for convex image recovery
- Aggregation-diffusion equations: dynamics, asymptotics, and singular limits
- Unconditional convergence for discretizations of dynamical optimal transport
- Multilevel optimal transport: a fast approximation of Wasserstein-1 distances
- A distributed framework for the construction of transport maps
- Computation of optimal transport with finite volumes
- Simulation of multiphase porous media flows with minimising movement and finite volume schemes
- A simple counterexample to the Monge ansatz in multimarginal optimal transport, convex geometry of the set of Kantorovich plans, and the Frenkel-Kontorova model
- Iterative Bregman projections for regularized transportation problems
- Optimal transport via a Monge-Ampère optimization problem
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- Minimal Geodesics Along Volume-Preserving Maps, Through Semidiscrete Optimal Transport
- Optimal transportation, modelling and numerical simulation
- Semi-discrete optimal transport: hardness, regularization and numerical solution
- Norm-dependent convergence and stability of the inverse scattering series for diffuse and scalar waves
- Template-based CT reconstruction with optimal transport and total generalized variation
- High order computation of optimal transport, mean field planning, and potential mean field games
- High order spatial discretization for variational time implicit schemes: Wasserstein gradient flows and reaction-diffusion systems
- Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm
- Implicit regularization effects of the Sobolev norms in image processing
- A fast proximal gradient method and convergence analysis for dynamic mean field planning
- Bridging mean-field games and normalizing flows with trajectory regularization
- A Scalable Deep Learning Approach for Solving High-Dimensional Dynamic Optimal Transport
- Wasserstein gradient flow of the Fisher information from a non-smooth convex minimization viewpoint
- Efficient preconditioners for solving dynamical optimal transport via interior point methods
- Forward-backward algorithm for functions with locally Lipschitz gradient: applications to mean field games
- Efficient and exact multimarginal optimal transport with pairwise costs
- On the convergence of discrete dynamic unbalanced transport models
- The geometry of monotone operator splitting methods
- Wasserstein medians: robustness, PDE characterization, and numerics
- Control methods in hyperbolic PDEs. Abstracts from the workshop held November 5--10, 2023
- Proximity operators of perspective functions with nonlinear scaling
- A bilevel optimization method for inverse mean-field games
- Distributed online optimization for multi-agent optimal transport
- Propagation of chaos for mean field Schrödinger problems
- Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation
- Unsupervised solution operator learning for mean-field games
- Unbalanced optimal transport, from theory to numerics
- Path constrained unbalanced optimal transport
- Primal-dual hybrid gradient algorithms for computing time-implicit Hamilton-Jacobi equations
- Gradient enhanced ADMM algorithm for dynamic optimal transport on surfaces
- Efficient computation of mean field control based barycenters from reaction-diffusion systems
- Synchronized optimal transport for joint modeling of dynamics across multiple spaces
- A time-fractional optimal transport: formulation and algorithm
- Discretization and convergence of the ballistic Benamou-Brenier formulation of the porous medium and Burgers' equations
- Regularized dynamic optimal transport for spatial-temporal image generation
- Truncated Differentiation for Inverse Potential MFGs
- Continuous displacement interpolation between checkerboard copulas
- Variable-preconditioned transformed primal-dual method for generalized Wasserstein gradient flows
- Joint inference of trajectory and obstacle in mean-field games via bilevel optimization
- On length measures of planar closed curves and the comparison of convex shapes
- Augmented Lagrangian methods for transport optimization, mean field games and degenerate elliptic equations
This page was built for publication: Optimal transport with proximal splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876803)
