{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:50:28Z","timestamp":1648839028399},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf02592094","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:33:10Z","timestamp":1175182390000},"page":"291-305","source":"Crossref","is-referenced-by-count":1,"title":["Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm"],"prefix":"10.1007","volume":"72","author":[{"given":"Masakazu","family":"Muramatsu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592094_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01594923","volume":"50","author":"I. Adler","year":"1991","unstructured":"I. Adler and R.D.C. Monteiro, \u201cLimiting behavior of the affine scaling continuous trajectories for linear programming problems,\u201dMathematical Programming 50 (1991) 29\u201351.","journal-title":"Mathematical Programming"},{"key":"BF02592094_CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/BF01840458","volume":"1","author":"K.M. Anstreicher","year":"1986","unstructured":"K.M. Anstreicher, \u201cA monotonic projective algorithm for fractional linear programming,\u201dAlgorithmica 1 (1986) 483\u2013498.","journal-title":"Algorithmica"},{"key":"BF02592094_CR3","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1287\/moor.14.2.294","volume":"14","author":"K.M. Anstreicher","year":"1989","unstructured":"K.M. Anstreicher, \u201cThe worst-case step in Karmarkar's algorithm,\u201dMathematics of Operations Research 14 (1989) 294\u2013302.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592094_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0801003","volume":"1","author":"K.M. Anstreicher","year":"1991","unstructured":"K.M. Anstreicher, \u201cOn the performance of Karmarkar's algorithm over a sequence of iterations,\u201dSIAM Journal on Optimization 1 (1991) 22\u201329.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592094_CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes \u201cA variation on Karmarkar's algorithm for solving linear programming problems,\u201dMathematical Programming 36 (1986) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"BF02592094_CR6","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming: I. Affine and projective trajectories,\u201dTransactions of the American Mathematical Society 314 (1989) 499\u2013526.","journal-title":"Transactions of the American Mathematical Society"},{"key":"BF02592094_CR7","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dSoviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"BF02592094_CR8","volume-title":"The convergence of dual variables","author":"I.I. Dikin","year":"1991","unstructured":"I.I. Dikin, \u201cThe convergence of dual variables,\u201d Technical Report., Siberian Energy Institute, Irkutsk (1991)."},{"key":"BF02592094_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02591685","volume":"37","author":"D.M. Gay","year":"1987","unstructured":"D.M. Gay, \u201cA variant of Karmarkar's linear programming algorithm for problems in standard form,\u201dMathematical Programming 37 (1987) 81\u201390.","journal-title":"Mathematical Programming"},{"key":"BF02592094_CR10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01582287","volume":"43","author":"C.C. Gonzaga","year":"1989","unstructured":"C.C. Gonzaga \u201cConical projection algorithms for linear programming,\u201dMathematical Programming 43 (1989) 151\u2013173.","journal-title":"Mathematical Programming"},{"key":"BF02592094_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02592094_CR12","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BF01585747","volume":"46","author":"C. McDiarmid","year":"1990","unstructured":"C. McDiarmid, \u201cOn the improvement per iteration in Karmarkar's algorithm for linear programming,\u201dMathematical Programming 46 (1990) 299\u2013320.","journal-title":"Mathematical Programming"},{"key":"BF02592094_CR13","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/BF02023109","volume":"7","author":"R.D.C. Monteiro","year":"1993","unstructured":"R.D.C. Monteiro, T. Tsuchiya and Y. Wang, \u201cA simplified global convergence proof of the affine scaling algorithm,\u201dAnnals of Operations Research 7 (1993) 443\u2013482.","journal-title":"Annals of Operations Research"},{"key":"BF02592094_CR14","volume-title":"Self-scaled barriers and interior-point methods for convex programming","author":"Yu.E. Nesterov","year":"1995","unstructured":"Yu.E. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming,\u201d Technical Report, School of OR\/IE. Cornell University Ithaca, NY (1995)."},{"key":"BF02592094_CR15","series-title":"Technical Report","volume-title":"A simple proof of primal affine scaling method","author":"R. Saigal","year":"1992","unstructured":"R. Saigal, A simple proof of primal affine scaling method,\u201d Technical Report, University of Michigan, Ann Arbor MI (1992)."},{"key":"BF02592094_CR16","series-title":"Technical Report","volume-title":"Potential reduction methods in mathematical programming","author":"M.J. Todd","year":"1995","unstructured":"M.J. Todd, \u201cPotential reduction methods in mathematical programming,\u201d Technical Report, School of OR\/IE, Cornell University, Ithaca, NY (1995)."},{"key":"BF02592094_CR17","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01840455","volume":"1","author":"M.J. Todd","year":"1986","unstructured":"M.J. Todd and B.P. Burrell, \u201cAn extension of Karmarkar's algorithm for linear programming using dual variables,\u201dAlgorithmica 1 (1986) 409\u2013424.","journal-title":"Algorithmica"},{"key":"BF02592094_CR18","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1137\/0805027","volume":"5","author":"T. Tsuchiya","year":"1995","unstructured":"T. Tsuchiya and M. Muramatsu, \u201cGlobal convergence of a long-step affine scaling algorithm for degenerate linear programming problems,\u201dSIAM Journal on Optimization 5 (1995) 525\u2013551.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592094_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/conm\/114\/1097868","volume":"114","author":"R.J. Vanderbei","year":"1990","unstructured":"R.J. Vanderbei and J.C. Lagarias, \u201cI.I. Dikin's convergence result for the affine-scaling algorithm,\u201dContemporary Mathematics 114 (1990) 109\u2013119.","journal-title":"Contemporary Mathematics"},{"key":"BF02592094_CR20","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon and B.A. Freedman, \u201cA modification of Karmarkar's linear programing algorithm,\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"},{"key":"BF02592094_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02592079","volume":"39","author":"Y. Ye","year":"1987","unstructured":"Y. Ye and M. Kojima, \u201cRecovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming,\u201dMathematical Programming 39 (1987) 305\u2013317.","journal-title":"Mathematical Programming"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592094.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592094\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF02592094"],"URL":"https:\/\/doi.org\/10.1007\/bf02592094","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}