Randomized methods for computing optimal transport without regularization and their convergence analysis
From MaRDI portal
Publication:6571381
Recommendations
- Accelerated Bregman Primal-Dual Methods Applied to Optimal Transport and Wasserstein Barycenter Problems
- Optimal transport: fast probabilistic approximation with exact solvers
- A multiscale semi-smooth Newton method for optimal transport
- A stable alternative to Sinkhorn's algorithm for regularized optimal transport
- Optimal transport problems regularized by generic convex functions: a geometric and algorithmic approach
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 7370538 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- A coordinate gradient descent method for nonsmooth separable minimization
- A geometric view of optimal transportation and generative model
- A multiscale semi-smooth Newton method for optimal transport
- A sparse multiscale algorithm for dense optimal transport
- Alternating minimization methods for strongly convex optimization
- An Interior Point–Inspired Algorithm for Linear Programs Arising in Discrete Optimal Transport
- An investigation of Newton-sketch and subsampled Newton methods
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Computation of optimal transport with finite volumes
- Computational optimal transport. With applications to data sciences
- Computations of optimal transport distance with Fisher information regularization
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- DeepParticle: learning invariant measure by a deep neural network minimizing Wasserstein distance on data generated from an interacting particle method
- Domain decomposition for entropy regularized optimal transport
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficient numerical methods for entropy-linear programming problems
- Fast iterative solution of the optimal transport problem on graphs
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Iterative Bregman projections for regularized transportation problems
- Matrix Balancing Based Interior Point Methods for Point Set Matching Problems
- Monotone and consistent discretization of the Monge-Ampère operator
- Multiscale strategies for computing optimal transport
- Numerical solution of the optimal transportation problem using the Monge-Ampère equation
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- On the complexity analysis of randomized block-coordinate descent methods
- On the convergence of block coordinate descent type methods
- Optimal mass transport for registration and warping
- Parallel coordinate descent methods for big data optimization
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- Polar factorization and monotone rearrangement of vector‐valued functions
- Random block coordinate descent methods for linearly constrained optimization over networks
- Randomized sketch descent methods for non-separable linearly constrained optimization
- SI-ADMM: A Stochastic Inexact ADMM Framework for Stochastic Convex Programs
- Scaling algorithms for unbalanced optimal transport problems
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- The 2-coordinate descent method for solving double-sided simplex constrained minimization problems
- The Variational Formulation of the Fokker--Planck Equation
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- Tractable ADMM schemes for computing KKT points and local minimizers for \(\ell_0\)-minimization problems
- Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version
This page was built for publication: Randomized methods for computing optimal transport without regularization and their convergence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6571381)
