Constrained approximate optimal transport maps
From MaRDI portal
Cites work
- \(BV\) estimates in optimal transportation and applications
- A note on generalized inverses
- A Wasserstein-Type Distance in the Space of Gaussian Mixture Models
- An extension of Karmarkar's projective algorithm for convex quadratic programming
- Computational optimal transport. With applications to data sciences
- Conservative set valued fields, automatic differentiation, stochastic gradient methods and deep learning
- Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
- scientific article; zbMATH DE number 6696602 (Why is no real title available?)
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 2152346 (Why is no real title available?)
- Lectures on optimal transport
- Minimax estimation of smooth optimal transport maps
- On the equality between Monge's infimum and Kantorovich's minimum in optimal mass transportation
- Optimal Transport
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Polar factorization and monotone rearrangement of vector‐valued functions
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Stochastic subgradient method converges on tame functions
- Subgradient Sampling for Nonsmooth Nonconvex Minimization
- Tame functions are semismooth
- The geometry of optimal transportation
- The Theory of Max-Min, with Applications
- Theory of Reproducing Kernels
This page was built for publication: Constrained approximate optimal transport maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6929238)
