{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T07:27:26Z","timestamp":1692430046072},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1007\/bf01582899","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"429-439","source":"Crossref","is-referenced-by-count":15,"title":["A combined phase I\u2014phase II scaled potential algorithm for linear programming"],"prefix":"10.1007","volume":"52","author":[{"given":"Kurt M.","family":"Anstreicher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Analysis of a modified Karmarkar algorithm for linear programming,\u201d Technical Report Series B #84","author":"K.M. Anstreicher","year":"1985","unstructured":"K.M. Anstreicher, \u201cAnalysis of a modified Karmarkar algorithm for linear programming,\u201d Technical Report Series B #84, Yale School of Management (New Haven, CT, 1985)."},{"key":"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":"CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582290","volume":"43","author":"K.M. Anstreicher","year":"1989","unstructured":"K.M. Anstreicher, \u201cA combined phase I-phase II projective algorithm for linear programming,\u201dMathematical Programming 43 (1989) 209\u2013223.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","volume":"1","author":"G. Ghellinck de","year":"1986","unstructured":"G. de Ghellinck and J.-P. Vial, \u201cA polynomial Newton method for linear programming,\u201dAlgorithmica 1 (1986) 425\u2013453.","journal-title":"Algorithmica"},{"key":"CR5","volume-title":"Linear updates for a single-phase projective method","author":"C. Fraley","year":"1989","unstructured":"C. Fraley, \u201cLinear updates for a single-phase projective method,\u201d COMIN, University of Geneva (Geneva, Switzerland, 1989)."},{"key":"CR6","volume-title":"Single-phase versus multi-phase projective methods for linear programming","author":"C. Fraley","year":"1989","unstructured":"C. Fraley and J.-P. Vial, \u201cSingle-phase versus multi-phase projective methods for linear programming,\u201d COMIN, University of Geneva (Geneva, Switzerland, 1989)."},{"key":"CR7","series-title":"Working Paper","volume-title":"Projective transformations for interior point methods, part I: basic theory and linear programming","author":"R.M. Freund","year":"1988","unstructured":"R.M. Freund, \u201cProjective transformations for interior point methods, part I: basic theory and linear programming,\u201d Working Paper OR 179-88, OR Center, MIT (Cambridge, MA, 1988)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01586933","volume":"51","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cPolynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,\u201dMathematical Programming 51 (1991a) 203\u2013222.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/BF01582900","volume":"52","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cA potential-function reduction algorithm for solving a linear program directly from an infeasible \u201cwarm start\u201d,\u201dMathematical Programming (Series B) 52 (1991b) 441\u2013466, this issue.","journal-title":"Mathematical Programming (Series B)"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0024-3795(91)90265-X","volume":"152","author":"R.M. Freund","year":"1991","unstructured":"R.M. Freund, \u201cTheoretical efficiency of a shifted barrier function algorithm for linear programming,\u201dLinear Algebra and its Applications 152 (1991c) 19\u201341.","journal-title":"Linear Algebra and its Applications"},{"key":"CR11","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":"CR12","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":"CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga, \u201cPolynominal affine algorithms for linear programming,\u201dMathematical Programming 49 (1990) 7\u201321.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/0801019","volume":"1","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cLarge-step path-following methods for linear programming, Part II: potential reduction method,\u201dSIAM Journal on Optimization 1 (1991) 280\u2013292.","journal-title":"SIAM Journal on Optimization"},{"key":"CR15","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":"CR16","volume-title":"An extension of Karmarkar's algorithm for bounded linear programming problems","author":"A.E. Steger","year":"1985","unstructured":"A.E. Steger, \u201cAn extension of Karmarkar's algorithm for bounded linear programming problems,\u201d M.S. Thesis, State University of New York (Stonybrook, NY, 1985)."},{"key":"CR17","volume-title":"\u201cThe effect of sparsity, degeneracy, and null and unbounded variables on variants of Karmarkar's linear programming algorithm,\u201d Technical Report 857","author":"M.J. Todd","year":"1989","unstructured":"M.J. Todd, \u201cThe effect of sparsity, degeneracy, and null and unbounded variables on variants of Karmarkar's linear programming algorithm,\u201d Technical Report 857, School of OR\/IE, Cornell University (Ithaca, NY, 1989)."},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"M.J. Todd, \u201cOn Anstreicher's combined phase I-phase II projective algorithm for linear programming,\u201d to appear in:Mathematical Programming (1992).","DOI":"10.1007\/BF01581187"},{"key":"CR19","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":"CR20","volume-title":"\u201cOn combined phase I-phase II projective methods for linear programming,\u201d Technical Report 877","author":"M.J. Todd","year":"1989","unstructured":"M.J. Todd and Y. Wang, \u201cOn combined phase I-phase II projective methods for linear programming,\u201d Technical Report 877, School of OR\/IE, Cornell University (Ithaca, NY, 1989)."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y. Ye","year":"1991","unstructured":"Y. Ye, \u201cAn O(n 3 L) potential reduction algorithm for linear programming,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"},{"key":"CR22","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\/BF01582899.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582899\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:15:55Z","timestamp":1556896555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582899"],"URL":"https:\/\/doi.org\/10.1007\/bf01582899","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}