Pages that link to "Item:Q2209529"
From MaRDI portal
The following pages link to A fast approach to optimal transport: the back-and-forth method (Q2209529):
Displaying 33 items.
- Discrete optimal transport: complexity, geometry and applications (Q262303) (← links)
- A sparse multiscale algorithm for dense optimal transport (Q334276) (← links)
- An iterative scheme for solving the optimal transportation problem (Q406682) (← links)
- Local matching indicators for concave transport costs (Q990247) (← links)
- Coupling matrix manifolds assisted optimization for optimal transport problems (Q2051257) (← links)
- Splitting methods for a class of non-potential mean field games (Q2068800) (← links)
- A particle-evolving method for approximating the optimal transport plan (Q2117959) (← links)
- Generalized unnormalized optimal transport and its fast algorithms (Q2131050) (← links)
- A multiscale semi-smooth Newton method for optimal transport (Q2144980) (← links)
- A geometric variational framework for computing optimal transportation maps. I (Q2171720) (← links)
- Semi-discrete optimal transport: a solution procedure for the unsquared Euclidean distance case (Q2216178) (← links)
- Weak solutions to the Muskat problem with surface tension via optimal transport (Q2219481) (← links)
- A simple method for the optimal transportation (Q2252678) (← links)
- No-collision transportation maps (Q2302392) (← links)
- The boundary method for semi-discrete optimal transport partitions and Wasserstein distance computation (Q2423519) (← links)
- Darcy's law with a source term (Q2658512) (← links)
- Vector copulas (Q2697978) (← links)
- Optrans: a parallel software library for optimal transport (Q2793002) (← links)
- Optimal transport with proximal splitting (Q2876803) (← links)
- An Algorithm for Optimal Transport between a Simplex Soup and a Point Cloud (Q4689764) (← links)
- Fast Entropic Regularized Optimal Transport Using Semidiscrete Cost Approximation (Q4691179) (← links)
- The back-and-forth method for Wasserstein gradient flows (Q4999527) (← links)
- Computational Methods for First-Order Nonlocal Mean Field Games with Applications (Q5164010) (← links)
- Inverse Optimal Transport (Q5217710) (← links)
- Optimal Transport for Parameter Identification of Chaotic Dynamics via Invariant Measures (Q5887850) (← links)
- Tumor growth with nutrients: Regularity and stability (Q6052394) (← links)
- Quantitative assessment of hippocampal network dynamics by combining voltage sensitive dye imaging and optimal transportation theory (Q6060134) (← links)
- Efficient Natural Gradient Descent Methods for Large-Scale PDE-Based Optimization Problems (Q6116387) (← links)
- Matrix Balancing Based Interior Point Methods for Point Set Matching Problems (Q6168327) (← links)
- An Optimal Transport Analogue of the Rudin–Osher–Fatemi Model and Its Corresponding Multiscale Theory (Q6202907) (← links)
- Efficient and exact multimarginal optimal transport with pairwise costs (Q6571369) (← links)
- Wasserstein archetypal analysis (Q6622692) (← links)
- Information geometry of Wasserstein statistics on shapes and affine deformations (Q6660909) (← links)