scientific article; zbMATH DE number 7370538
From MaRDI portal
Publication:4998892
Kim-Chuan Toh, Defeng Sun, Jia Li, Lei Yang
Publication date: 9 July 2021
Full work available at URL: https://arxiv.org/abs/1809.04249
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Geometric Averages of Partitioned Datasets, The GenCol Algorithm for High-Dimensional Optimal Transport: General Formulation and Application to Barycenters and Wasserstein Splines, Matrix Balancing Based Interior Point Methods for Point Set Matching Problems, Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport, A column generation approach to the discrete barycenter problem, Simple approximative algorithms for free-support Wasserstein barycenters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast Algorithms for Large-Scale Generalized Distance Weighted Discrimination
- Fast projection onto the simplex and the \(l_1\) ball
- Discrete Wasserstein barycenters: optimal transport for discrete data
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A convexity principle for interacting gases
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Convolutional wasserstein distances
- Hankel Matrix Rank Minimization with Applications to System Identification and Realization
- Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
- A Convergent $3$-Block Semi-Proximal ADMM for Convex Minimization Problems with One Strongly Convex Block
- Barycenters in the Wasserstein Space
- Quadratically Regularized Optimal Transport on Graphs
- Numerical methods for matching for teams and Wasserstein barycenters
- Combinatorics and Geometry of Transportation Polytopes: An Update
- Some continuity properties of polyhedral multifunctions
- Variational Analysis
- Characterization of barycenters in the Wasserstein space by averaging optimal transport maps
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- A Smoothed Dual Approach for Variational Wasserstein Problems
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- Iterative Bregman Projections for Regularized Transportation Problems
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
