The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
A Comparative Study of Algorithms for Matrix Balancing
Abstract
The problem of adjusting the entries of a large matrix to satisfy prior consistency requirements occurs in economics, urban planning, statistics, demography, and stochastic modeling; these problems are called Matrix Balancing Problems. We describe five applications of matrix balancing and compare the algorithmic and computational performance of balancing procedures that represent the two primary approaches for matrix balancing—matrix scaling and nonlinear optimization. The algorithms we study are the RAS algorithm, a diagonal similarity scaling algorithm, and a truncated Newton algorithm for network optimization. We present results from computational experiments with large-scale problems based on producing consistent estimates of Social Accounting Matrices for developing countries.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Deming, W. E., & Stephan, F. F. (1940) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177731829 · Cited by 1,537
Cited by
Robust Optimization of Large-Scale Systems
Mulvey, J. M., Vanderbei, R. J., & Zenios, S. A. (1995) · Operations Research · doi:10.1287/opre.43.2.264 · Cited by 1,944
Self-citationOn the convergence of the coordinate descent method for convex differentiable minimization
Luo, Z. Q., & Tseng, P. (1992) · Journal of Optimization Theory and Applications · doi:10.1007/bf00939948 · Cited by 502
Updating and Estimating a Social Accounting Matrix Using Cross Entropy Methods
Robinson, S., Cattaneo, A., & El-Said, M. (2001) · Economic Systems Research · doi:10.1080/09535310120026247 · Cited by 455
Complementarity problems in GAMS and the PATH solver
Ferris, M. C., & Munson, T. S. (2000) · Journal of Economic Dynamics and Control · doi:10.1016/s0165-1889(98)00092-x · Cited by 400
Flexible mobility on-demand: an environmental scan
Liyanage, S., Dia, H., Abduljabbar, R., & Bagloee, S. (2019) · Sustainability · doi:10.3390/su11051262 · Cited by 111
Metadata
- Authors
- Schneider, M. H., & Zenios, S. A.
- Venue
- Operations Research
- Published
- 1990-06
- Volume
- 38
- Issue
- 3
- Pages
- 439-455
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2011848437
- Cited by
- 191
- References
- 1
- FWCI
- 7.80
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.