Pages that link to "Item:Q2465654"
From MaRDI portal
The following pages link to On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654):
Displayed 15 items.
- Biproportional scaling of matrices and the iterative proportional fitting procedure (Q744690) (← links)
- Divisor methods for proportional representation systems: an optimization approach to vector and matrix apportionment problems (Q943580) (← links)
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling (Q2039246) (← links)
- Robust learning in social networks via matrix scaling (Q2060364) (← links)
- Matrix scaling and explicit doubly stochastic limits (Q2321351) (← links)
- Certificates of optimality for minimum norm biproportional apportionments (Q2340260) (← links)
- Balancing of agricultural census data by using discrete optimization (Q2448220) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- Network flow methods for electoral systems (Q2892147) (← links)
- Parametric maximum flow methods for minimax approximation of target quotas in biproportional apportionment (Q2892156) (← links)
- (Q5240418) (← links)
- An entropy optimizing RAS-equivalent algorithm for iterative matrix balancing (Q6040280) (← links)
- Nonequispaced fast Fourier transform boost for the Sinkhorn algorithm (Q6105414) (← links)
- Apportionment with parity constraints (Q6120934) (← links)
- Matrix Balancing Based Interior Point Methods for Point Set Matching Problems (Q6168327) (← links)