{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T11:29:45Z","timestamp":1680434985568},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":[[1993,2]]},"DOI":"10.1007\/bf01585161","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:16:57Z","timestamp":1114665417000},"page":"85-93","source":"Crossref","is-referenced-by-count":3,"title":["On the big\u2133 in the affine scaling algorithm"],"prefix":"10.1007","volume":"62","author":[{"given":"Tohru","family":"Ishihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1988","unstructured":"I. Adler, N. Karmarkar, M. Resende and G. Veiga, \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 44 (1988) 297\u2013335.","journal-title":"Mathematical Programming"},{"key":"CR2","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":"CR3","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":"CR4","first-page":"54","volume":"12","author":"I.I. Dikin","year":"1974","unstructured":"I.I. Dikin, \u201cOn the speed of an iterative process,\u201dUpravlyaemye Sistemi 12 (1974) 54\u201360.","journal-title":"Upravlyaemye Sistemi"},{"key":"CR5","volume-title":"\u201cThe convergence of dual variables,\u201d Technical Report","author":"I.I. Dikin","year":"1991","unstructured":"I.I. Dikin, \u201cThe convergence of dual variables,\u201d Technical Report, Siberian Energy Institute (Irkurtsk, Russia, 1991)."},{"key":"CR6","volume-title":"Convergence of the large step primal affine-scaling algorithm for primal nondegenerate linear programs","author":"C.C Gonzaga","year":"1990","unstructured":"C.C Gonzaga, \u201cConvergence of the large step primal affine-scaling algorithm for primal nondegenerate linear programs,\u201d Department of Systems Engineering and Computer Sciences, COPPE-Federal University of Rio de Janeiro (Rio de Janeiro, Brazil, 1990)."},{"key":"CR7","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":"CR8","first-page":"29","volume-title":"Progress in Mathematical Programming, Interior-Point and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal-dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior-Point and Related Methods (Springer, New York, 1989) pp. 29\u201347."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01581253","volume":"59","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA little theorem of the big \u2133 in interior point algorithm,\u201dMathematical Programming 59 (1993) 361\u2013375.","journal-title":"Mathematical Programming"},{"key":"CR10","first-page":"131","volume-title":"Progress in Mathematical Programming, Interior-Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior-Point and Related Methods (Springer, New York, 1989) pp. 131\u2013158."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF01582896","volume":"52","author":"T. Tsuchiya","year":"1991","unstructured":"T. Tsuchiya, \u201cGlobal convergence of the affine scaling methods for degenerate linear programming problems,\u201dMathematical Programming 52 (1991) 377\u2013404.","journal-title":"Mathematical Programming"},{"key":"CR12","series-title":"Research Memorandum","volume-title":"Global convergence of a long-step affine scaling algorithm for degenerate linear programming problems","author":"T. Tsuchiya","year":"1992","unstructured":"T. Tsuchiya and M. Muramatsu, \u201cGlobal convergence of a long-step affine scaling algorithm for degenerate linear programming problems,\u201d Research Memorandum No. 423, The Institute of Statistical Mathematics (Minato-ku, Tokyo, Japan, 1992)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"22","DOI":"10.15807\/jorsj.33.22","volume":"33","author":"T. Tsuchiya","year":"1990","unstructured":"T. Tsuchiya and K. Tanabe, \u201cLocal convergence properties of new methods in linear programming,\u201dJournal of the Operations Research Society of Japan 33 (1990) 22\u201345.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF01582276","volume":"43","author":"R.J. Vanderbei","year":"1989","unstructured":"R.J. Vanderbei, \u201cAffine-scaling for linear programs with free variables,\u201dMathematical Programming 43 (1989) 31\u201344.","journal-title":"Mathematical Programming"},{"key":"CR15","volume-title":"I.I. Dikin's convergence results for the affine-scaling algorithm","author":"R.J. Vanderbei","year":"1988","unstructured":"R.J. Vanderbei and J.C. Lagarias, \u201cI.I. Dikin's convergence results for the affine-scaling algorithm,\u201d Preprints, AT&T Bell Laboratories (Murray Hill, NJ, 1988)."},{"key":"CR16","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 programming algorithm\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585161.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585161\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585161","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:26Z","timestamp":1556883146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF01585161"],"URL":"https:\/\/doi.org\/10.1007\/bf01585161","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}