A sparse smoothing Newton method for solving discrete optimal transport problems
From MaRDI portal
Cites work
- A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters
- A multiscale semi-smooth Newton method for optimal transport
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A nonsmooth version of Newton's method
- A polynomial time primal network simplex algorithm for minimum cost flows
- A Potential Reduction Algorithm Allowing Column Generation
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A semismooth Newton-type method for the nearest doubly stochastic matrix problem
- A smoothing-out technique for min—max optimization
- A sparse multiscale algorithm for dense optimal transport
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- Barycenters in the Wasserstein space
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Constraint Reduction for Linear Programs with Many Inequality Constraints
- Discrete Wasserstein barycenters: optimal transport for discrete data
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- Fast Discrete Distribution Clustering Using Wasserstein Barycenter With Sparse Support
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Hedonic price equilibria, stable matching, and optimal transport: Equivalence, topology, and uniqueness
- scientific article; zbMATH DE number 3912096 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 1502617 (Why is no real title available?)
- scientific article; zbMATH DE number 1421091 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Iterative Bregman projections for regularized transportation problems
- Optimal Transport
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Semismooth and Semiconvex Functions in Constrained Optimization
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
- The earth mover's distance as a metric for image retrieval
- Über partielle und totale Differenzierbarkeit von Funktionen mehrerer Variablen und über die Transformation der Doppelintegrale. I, II.
This page was built for publication: A sparse smoothing Newton method for solving discrete optimal transport problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028244)
