Exponential convergence of general iterative proportional fitting procedures
From MaRDI portal
Cites work
- An Iterative Procedure for Estimation in Contingency Tables
- An iterative procedure for obtaining I-projections onto the intersection of convex sets
- Causal transport in discrete time and applications
- Computation of optimal transport and related hedging problems via penalization and neural networks
- Computational methods for adapted optimal transport
- Computational optimal transport. With applications to data sciences
- Convergence of entropic schemes for optimal transport and gradient flows
- Convergence of the iterative proportional fitting procedure
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Diagonal Equivalence to Matrices with Prescribed Row and Column Sums
- Duality Formulas for Robust Pricing and Hedging in Discrete Time
- Entropic and displacement interpolation: a computational approach using the Hilbert metric
- Foundations of quantization for probability distributions
- Frameworks and results in distributionally robust optimization
- From the Schrödinger problem to the Monge-Kantorovich problem
- Hilbert's projective metric for functions of bounded growth and exponential convergence of Sinkhorn's algorithm
- scientific article; zbMATH DE number 1022519 (Why is no real title available?)
- scientific article; zbMATH DE number 878830 (Why is no real title available?)
- I-divergence geometry of probability distributions and minimization problems
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Information projections revisited
- On a least squares adjustment of a sampled frequency table when the expected marginal totals are known.
- On a problem of optimal transport under marginal martingale constraints
- On certain inequalities and characteristic value problems for analytic functions and for functions of two variables.
- On the linear convergence of the multimarginal Sinkhorn algorithm
- On the Monge-Kantorovich problem with additional linear constraints
- Optimal transport and Wasserstein distances for causal models
- Sharper exponential convergence rates for Sinkhorn's algorithm in continuous settings
This page was built for publication: Exponential convergence of general iterative proportional fitting procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262231)