{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T21:25:23Z","timestamp":1768080323703,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,9,2]],"date-time":"2006-09-02T00:00:00Z","timestamp":1157155200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,11,30]]},"DOI":"10.1007\/s10107-006-0021-4","type":"journal-article","created":{"date-parts":[[2006,9,1]],"date-time":"2006-09-01T14:15:03Z","timestamp":1157120103000},"page":"371-401","source":"Crossref","is-referenced-by-count":33,"title":["On the complexity of general matrix scaling and entropy minimization via the RAS algorithm"],"prefix":"10.1007","volume":"112","author":[{"given":"B.","family":"Kalantari","sequence":"first","affiliation":[]},{"given":"I.","family":"Lari","sequence":"additional","affiliation":[]},{"given":"F.","family":"Ricca","sequence":"additional","affiliation":[]},{"given":"B.","family":"Simeone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,2]]},"reference":[{"key":"21_CR1","unstructured":"Bacharach M. Biproportional matrices and input\u2013output change. Cambridge (1970)"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02252097","volume":"23","author":"A. Bachem","year":"1979","unstructured":"Bachem A., Korte B (1979) On the RAS algorithm. Computing 23, 189\u2013198","journal-title":"Computing"},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"700","DOI":"10.1287\/moor.14.4.700","volume":"14","author":"G. BalinskiM.L. Demange","year":"1989","unstructured":"Balinski M.L. Demange G. (1989) An axiomatic approach to proportionality between matrices. Math. Oper. Res. 14, 700\u2013719","journal-title":"Math. Oper. Res."},{"key":"21_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01589103","volume":"45","author":"M.L. Balinski","year":"1989","unstructured":"Balinski M.L., Demange G. (1989) Algorithms for proportional matrices in reals and integers. Math. Program. (Ser. B) 45, 193\u2013210","journal-title":"Math. Program. (Ser. B)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bertsekas D.P., Polymenakos L.C., Tseng P. Epsilon-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems in Network Optimization. In: Pardalos P.M., Hearn D.W., Hager W.W. (eds) Proceedings of International Conference on Network Optimization. Springer, Berlin Heidelberg New York, 1998, pp 103\u2013126 (1989)","DOI":"10.1007\/978-3-642-59179-2_6"},{"key":"21_CR6","first-page":"219","volume":"85","author":"G. Birkhoff","year":"1957","unstructured":"Birkhoff G. (1957) Extensions of Jentzsch\u2019s theorem. Trans. Am. Math. Soc. 85, 219\u2013227","journal-title":"Trans. Am. Math. Soc."},{"key":"21_CR7","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0041-5553(67)90069-9","volume":"7","author":"L.M. Bregman","year":"1967","unstructured":"Bregman L.M. (1967) Proof of convergence of Sheleikhovskii\u2019s method for a problem with transportation constraints. USSR Comput. Math. Math. Phys. 7, 191\u2013204","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0022-247X(66)90184-3","volume":"16","author":"R.A. Brualdi","year":"1966","unstructured":"Brualdi R.A., Prater S.V., Schneider H. (1966) The diagonal equivalence of a nonnegative matrix to a stochastic matrix. J. Math. Ann. Appl. 16, 31\u201350","journal-title":"J. Math. Ann. Appl."},{"key":"21_CR9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.4153\/CJM-1968-016-9","volume":"20","author":"R.A. Brualdi","year":"1968","unstructured":"Brualdi R.A. (1968) Convex sets of nonnegative matrices. Can. J. Math. 20, 144\u2013157","journal-title":"Can. J. Math."},{"issue":"115","key":"21_CR10","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1016\/0024-3795(89)90490-4","volume":"114","author":"J. Franklin","year":"1989","unstructured":"Franklin J., Lorenz J. (1989) On the scaling of multidimensional matrices. Linear Algebra Appl. 114\/115: 717\u2013735","journal-title":"Linear Algebra Appl."},{"key":"21_CR11","volume-title":"Network Optimization Problems.","author":"D.S. Hochbaum","year":"1993","unstructured":"Hochbaum D.S. (1993) Polynomial and strongly polynomial algorithms for convex network optimization. In: Du D.Z., Pardalos P. (eds) Network Optimization Problems. World Scientific, Singapore"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Kalantari, B.: Canonical problems for quadratic programming and projective methods for their solution. In: Lagarias, J.C., Todd, M. (eds.) Contemporary Mathematics. vol. 114, pp. 243\u2013263. Proceedings of AMS conference \u201cMathematical problems arising from linear programming\u201d, 1988 (1990)","DOI":"10.1090\/conm\/114\/1097877"},{"key":"21_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-1-4613-3554-2_12","volume-title":"Combinatorics Advances.","author":"B. Kalantari","year":"1995","unstructured":"Kalantari B. (1995) A simple polynomial time algorithm for a convex hull problem equivalent to linear programming. In: Colbourn C.J., Mahmoodian E.S. (eds). Combinatorics Advances. Kluwer, Dordrecht, pp. 207\u2013216"},{"key":"21_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0024-3795(94)00162-6","volume":"236","author":"B. Kalantari","year":"1996","unstructured":"Kalantari B. (1996) A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices. Linear Algebra Appl. 236, 1\u201324","journal-title":"Linear Algebra Appl."},{"key":"21_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0024-3795(03)00664-5","volume":"375","author":"B. Kalantari","year":"2003","unstructured":"Kalantari B. (2003) Semidefinite Programming and Matrix Scaling over the Semidefinite Cone. Linear Algebra Appl. 375, 221\u2013243","journal-title":"Linear Algebra Appl."},{"key":"21_CR16","unstructured":"Kalantari, B.: Scaling dualities and self-concordant homogeneous programming in finite dimensional spaces. Technical Report LCSR-TR-359, Department of Computer Science, Rutgers University, New Brunswick (1999)"},{"key":"21_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0167-6377(93)90087-W","volume":"14","author":"B. Kalantari","year":"1993","unstructured":"Kalantari B., Khachiyan L. (1993) On the rate of convergence of deterministic and randomized RAS matrix scaling method. Oper. Res. Lett. 14, 237\u2013244","journal-title":"Oper. Res. Lett."},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0024-3795(94)00188-X","volume":"240","author":"B. Kalantari","year":"1996","unstructured":"Kalantari B., Khachiyan L. (1996) On the complexity of nonnegative-matrix scaling. Linear Algebra Appl. 240, 87\u2013103","journal-title":"Linear Algebra Appl."},{"key":"21_CR19","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1137\/S0895479895289765","volume":"16","author":"B. Kalantari","year":"1997","unstructured":"Kalantari B., Khachiyan L., Shokoufandeh A. (1997) On the complexity of matrix balancing. SIAM J. Matrix Anal. Appl. 16, 450\u2013463","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"21_CR20","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0024-3795(97)80036-5","volume":"262","author":"B. Kalantari","year":"1997","unstructured":"Kalantari B., Emamy-K M.R. (1997) On linear programming and matrix scaling over the algebraic numbers. Linear Algebra Appl. 262, 283\u2013306","journal-title":"Linear Algebra Appl."},{"key":"21_CR21","unstructured":"Kalantari, B., Lari, I., Ricca, F., Simeone, B.: On the complexity of general matrix scaling and entropy minimization via the RAS algorithm. Technical Report, n.24, Department of Statistics and Applied probability, La Sapienza University, Rome (2002)"},{"key":"21_CR22","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar N. (1984) A new polynomial time algorithm for linear programming. Combinatorica 4, 373\u2013395","journal-title":"Combinatorica"},{"key":"21_CR23","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/S0097539794263695","volume":"26","author":"S.T. KarzanovA.V. McCormick","year":"1997","unstructured":"Karzanov A.V. McCormick S.T. (1997) Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM J. Comput. 26, 1245\u20131275","journal-title":"SIAM J. Comput."},{"key":"21_CR24","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1137\/0802034","volume":"4","author":"L. Khachiyan","year":"1992","unstructured":"Khachiyan L., Kalantari B. (1992) Diagonal matrix scaling and linear programming. SIAM J. Optim. 4, 668\u2013672","journal-title":"SIAM J. Optim."},{"key":"21_CR25","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s004930070007","volume":"20","author":"N. Linial","year":"2000","unstructured":"Linial N., Samorodnitsky A., Wigderson A. (2000) A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica 20, 545\u2013568","journal-title":"Combinatorica"},{"key":"21_CR26","volume-title":"Matching Theory. Annals of Discrete Mathematics. vol 121.","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L., Plummer M.D. (1986) Matching Theory. Annals of Discrete Mathematics, vol 121. North-Holland, Amsterdam"},{"key":"21_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02170999","volume":"12","author":"A.W. Marshall","year":"1968","unstructured":"Marshall A.W., Olkin I. (1968) Scaling of matrices to achieve specified row and column sums. Numer. Math. 12, 83\u201390","journal-title":"Numer. Math."},{"key":"21_CR28","first-page":"309","volume":"9","author":"J. Maxfield","year":"1962","unstructured":"Maxfield J., Minc H. (1962) A doubly stochastic matrix equivalent to a given matrix. Notices Am. Math. Soc. 9, 309","journal-title":"Notices Am. Math. Soc."},{"key":"21_CR29","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1090\/S0002-9939-1967-0215873-6","volume":"18","author":"M.V. Menon","year":"1967","unstructured":"Menon M.V. (1967) Reduction of a matrix with positive elements to a doubly stochastic matrix. Proc. Am. Math. Soc. 18, 244\u2013247","journal-title":"Proc. Am. Math. Soc."},{"key":"21_CR30","volume-title":"Nonnegative Matrices","author":"H. Minc","year":"1988","unstructured":"Minc H. (1988) Nonnegative Matrices. Wiley, New York"},{"issue":"303","key":"21_CR31","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0024-3795(99)00212-8","volume":"302","author":"A. Nemirovski","year":"1999","unstructured":"Nemirovski A., Rothblum U.G. (1999) On complexity of matrix scaling. Linear Algebra Appl. 302\/303: 435\u2013460","journal-title":"Linear Algebra Appl."},{"key":"21_CR32","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y. Nesterov","year":"1994","unstructured":"Nesterov Y., Nemirovskii A.S. (1994) Interior-Point Polynomial Algorithms in Convex Programming. SIAM, Philadelphia"},{"key":"21_CR33","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1137\/0803043","volume":"4","author":"F. Potra","year":"1993","unstructured":"Potra F., Ye Y. (1993) A quadratically convergent polynomial algorithm for solving entropy optimization problems. SIAM J. Optm. 4, 843\u2013860","journal-title":"SIAM J. Optm."},{"issue":"115","key":"21_CR34","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1016\/0024-3795(89)90491-6","volume":"114","author":"U.G. Rothblum","year":"1989","unstructured":"Rothblum U.G., Schneider H. (1989) Scaling of matrices which have prescribed row sums and column sums via optimization. Linear Algebra Appl. 114\/115: 737\u2013764","journal-title":"Linear Algebra Appl."},{"issue":"115","key":"21_CR35","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0024-3795(89)90492-8","volume":"114","author":"U.G. Rothblum","year":"1989","unstructured":"Rothblum U.G. (1989) Generalized scaling satisfying linear equations. Linear Algebra Appl. 114\/115: 765\u2013783","journal-title":"Linear Algebra Appl."},{"key":"21_CR36","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1287\/opre.38.3.439","volume":"38","author":"M.H. Schneider","year":"1989","unstructured":"Schneider M.H., Zenios S.A. (1989) A comparative study of algorithms for matrix balancing. Oper. Res. 38, 439\u2013455","journal-title":"Oper. Res."},{"issue":"115","key":"21_CR37","doi-asserted-by":"crossref","first-page":"785","DOI":"10.1016\/0024-3795(89)90493-X","volume":"114","author":"M.H. Schneider","year":"1989","unstructured":"Schneider M.H. (1989) Matrix scaling, entropy minimization, and conjugate duality. Linear Algebra Appl. 114\/115: 785\u2013813","journal-title":"Linear Algebra Appl."},{"key":"21_CR38","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1214\/aoms\/1177703591","volume":"35","author":"R. Sinkhorn","year":"1964","unstructured":"Sinkhorn R. (1964) A relationship between arbitrary positive matrices and doubly stochastic matrices. Ann. Math. Statist. 35, 876\u2013879","journal-title":"Ann. Math. Statist."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0021-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0021-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0021-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:00Z","timestamp":1559123400000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0021-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,2]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,11,30]]}},"alternative-id":["21"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0021-4","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,2]]}}}