scientific article; zbMATH DE number 6860777
From MaRDI portal
Publication:4636980
zbMath1435.65095arXiv1708.02469MaRDI QIDQ4636980
Publication date: 17 April 2018
Full work available at URL: https://arxiv.org/abs/1708.02469
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Numerical mathematical programming methods (65K05) Linear programming (90C05) Optimal transportation (49Q22)
Related Items (10)
A multiscale semi-smooth Newton method for optimal transport ⋮ Randomized Wasserstein Barycenter Computation: Resampling with Statistical Guarantees ⋮ A Global Optimization Approach for Multimarginal Optimal Transport Problems with Coulomb Cost ⋮ Wassmap: Wasserstein Isometric Mapping for Image Manifold Learning ⋮ A stochastic multi-layer algorithm for semi-discrete optimal transport with applications to texture synthesis and style transfer ⋮ Ground metric learning on graphs ⋮ Transport Model for Feature Extraction ⋮ Kantorovich-Rubinstein distance and barycenter for finitely supported measures: foundations and algorithms ⋮ SCOTT: Shape-Location Combined Tracking with Optimal Transport ⋮ Empirical Regularized Optimal Transport: Statistical Theory and Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sparse multiscale algorithm for dense optimal transport
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- Multi-scale geometric methods for data sets. II: Geometric multi-resolution analysis
- Iterative scheme for solving optimal transportation problems arising in reflector design
- A partial differential equation for the rank one convex envelope
- A Lagrangian scheme for the solution of the optimal mass transfer problem
- A polynomial time primal network simplex algorithm for minimum cost flows
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- Minkowski-type theorems and least-squares clustering
- Quad trees: A data structure for retrieval by composite keys
- The earth mover's distance as a metric for image retrieval
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- Multiscale geometric methods for data sets. I: Multiscale SVD, noise and curvature.
- Optimal mass transport for registration and warping
- On the Translocation of Masses
- Multiscale Dictionary Learning: Non-Asymptotic Bounds and Robustness
- Decomposition Principle for Linear Programs
- Optimal Transportation with Traffic Congestion and Wardrop Equilibria
- Plongements lipschitziens dans ${\bbfR}\sp n$
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Polar factorization and monotone rearrangement of vector‐valued functions
- Multidimensional binary search trees used for associative searching
- A network simplex method
- Minimizing Flows for the Monge--Kantorovich Problem
- Functional map networks for analyzing and exploring large shape collections
- Approximation of points on low-dimensional manifolds via random linear projections
- Adaptive Geometric Multiscale Approximations for Intrinsically Low-dimensional Data
- A Primer in Column Generation
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
- A Continuous Model of Transportation
- Optimal Transport
This page was built for publication:
