Corpus ID: 118221593

Solution of the optimal assignment problem by diagonal scaling algorithms

  title={Solution of the optimal assignment problem by diagonal scaling algorithms},
  author={Meisam Sharify and St{\'e}phane Gaubert and Laura Grigori},
  journal={arXiv: Numerical Analysis},
We show that a solution of the optimal assignment problem can be obtained as the limit of the solution of an entropy maximization problem, as a deformation parameter tends to infinity. This allows us to apply entropy maximization algorithms to the optimal assignment problem. In particular, the Sinkhorn algorithm leads to a parallelizable method, which can be used as a preprocessing to handle large dense optimal assignment problems. This parallel preprocessing allows one to delete entries which… Expand

Figures and Tables from this paper

Scaling Algorithms for Unbalanced Transport Problems
This article introduces a new class of fast algorithms to approx-imate variational problems involving unbalanced optimal transport. While classical optimal transport considers only normalizedExpand
An explicit analysis of the entropic penalty in linear programming
  • J. Weed
  • Computer Science, Mathematics
  • COLT
  • 2018
A new proof of the exponential convergence, valid for any linear program, is given, which is non-asymptotic, yields explicit constants, and has the virtue of being extremely simple. Expand
Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
A log-domain stabilized formulation, the well-known epsilon-scaling heuristic, an adaptive truncation of the kernel and a coarse-to-fine scheme are combined, allowing the solution of larger problems with smaller regularization and negligible truncation error. Expand
Approximation of optimal transport problems with marginal moments constraints
This work investigates the relaxation of the OT problem when the marginal constraints are replaced by some moment constraints, using Tchakaloff's theorem to show that the Moment Constrained Optimal Transport problem (MCOT) is achieved by a finite discrete measure. Expand
Special and structured matrices in max-plus algebra
The aim of this thesis is to present efficient (strongly polynomial) methods and algorithms for problems in max­algebra when certain matrices have special entries or are structured. First, weExpand
Loopy annealing belief propagation for vertex cover and matching: convergence, LP relaxation, correctness and Bethe approximation
An iterative loopy annealing BP (LABP) algorithm which is shown to converge and to solve a Linear Programming relaxation of the vertex cover or matching problem on general graphs. Expand
Character-Position Arithmetic for Analogy Questions between Word Forms
We show how to answer analogy questions A : B :: C : D of unknown D between word forms, by essentially relying on the basic arithmetic equality D[iB − iA + iC ] = B[iB ] − A[iA] + C[iC ] onExpand
Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment
  • P. S. Kumar
  • Computer Science
  • Int. J. Fuzzy Syst. Appl.
  • 2020
Whenpeoplesolvereal-lifeSAPtheytendtofacetheuncertaintystateaswellashesitationdueto manyuncontrollablefactors.TodealwithuncertaintyandhesitationmanyauthorshavesuggestedExpand
Transport optimal de mesures positives : modèles, méthodes numériques, applications
L'objet de cette these est d'etendre le cadre theorique et les methodes numeriques du transport optimal a des objets plus generaux que des mesures de probabilite. En premier lieu, nous definissonsExpand
An Exploration of Learnt Representations of W Jets
  • Jack H. Collins
  • Physics, Computer Science
  • 2021
I present a Variational Autoencoder (VAE) trained on collider physics data (specifically boosted W jets), with reconstruction error given by an approximation to the Earth Movers Distance (EMD)Expand


On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
This work considers bipartite matching algorithms for computing permutations of a sparse matrix so that the diagonal of the permuted matrix has entries of large absolute value and considers scaling techniques to increase the relative values of the diagonal entries. Expand
A Fast Algorithm for Matrix Balancing
  • P. Knight, D. Ruiz
  • Mathematics, Computer Science
  • Web Information Retrieval and Linear Algebra Algorithms
  • 2007
It is shown that while stationary iterative methods offer little or no improvement in many cases, a scheme using a preconditioned conjugate gradient method as the inner iteration can give quadratic convergence at low cost. Expand
Towards auction algorithms for large dense assignment problems
A modified auction algorithm is introduced, called look-back auction algorithm, which extends the forward auction algorithm by the ability of reusing information from previous bids, which shows that it is able to reuse information from the previous bids with high efficiency for all tested types of input instances. Expand
An Algorithm for Solving the Assignment Problem
For the convenience to build decision-making supporting system related to the assignment problem, a numerical algorithm is presented for solving the assignment problem in this paper。The theory, onExpand
The Sinkhorn-Knopp Algorithm: Convergence and Applications
  • P. Knight
  • Mathematics, Computer Science
  • SIAM J. Matrix Anal. Appl.
  • 2008
It is shown that with an appropriate modification, the Sinkhorn-Knopp algorithm is a natural candidate for computing the measure on enormous data sets. Expand
Entropy minimization, DAD problems, and doubly stochastic kernels
Abstract The classical DAD problem asks, for a square matrix A with nonnegative entries, when it is possible to find positive diagonal matrices D 1 and D 2 with D 1 AD 2 doubly stochastic. WeExpand
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents
This work develops the first strongly polynomial-time algorithm for matrix scaling –– an important nonlinear optimization problem with many applications and suggests a simple new (slow)Polynomial time decision algorithm for bipartite perfect matching. Expand
Assignment Problems
This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments and can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science. Expand
Data path allocation based on bipartite weighted matching
This research has demonstrated that the bipartite weighted matching algorithm is indeed a very good solution for the data path allocation problem and is able to take the interconnection cost into account. Expand
The Hungarian method for the assignment problem
This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest toExpand