{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T13:08:21Z","timestamp":1648818501135},"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\/bf01582898","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"415-428","source":"Crossref","is-referenced-by-count":4,"title":["On lower bound updates in primal potential reduction methods for linear programming"],"prefix":"10.1007","volume":"52","author":[{"given":"Clovis C.","family":"Gonzaga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/BF01840458","volume":"1","author":"K. Anstreicher","year":"1986","unstructured":"K. Anstreicher, \u201cA monotonic projective algorithm for fractional linear programming,\u201dAlgorithmica 1 (1986) 483\u2013498.","journal-title":"Algorithmica"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"K. Anstreicher and R. Bosch, \u201cLong steps in a O(n 3 L) algorithm for linear programming,\u201d to appear in:Mathematical Programming (1992).","DOI":"10.1007\/BF01586053"},{"key":"CR3","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 (1991) 203\u2013222.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","volume":"1","author":"G. Chellinck de","year":"1986","unstructured":"G. de Chellinck and J.-P. Vial, \u201cA polynomial Newton method for linear programming,\u201dAlgorithmica 1 (1986) 425\u2013453.","journal-title":"Algorithmica"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01582287","volume":"43","author":"C. Gonzaga","year":"1988","unstructured":"C. Gonzaga, \u201cConical projection algorithms for linear programming,\u201dMathematical Programming 43 (1988) 151\u2013173.","journal-title":"Mathematical Programming"},{"key":"CR6","volume-title":"\u201cLarge-steps path-following algorithms for linear programming: Potential reduction method,\u201d Internal Report","author":"C. Gonzaga","year":"1989","unstructured":"C. Gonzaga, \u201cLarge-steps path-following algorithms for linear programming: Potential reduction method,\u201d Internal Report, COPPE \u2014 Federal University of Rio de Janeiro (Rio de Janeiro, Brasil, 1989)."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C. Gonzaga","year":"1991","unstructured":"C. Gonzaga, \u201cPolynomial affine algorithms for linear programming,\u201dMathematical Programming 49 (1991) 7\u201321.","journal-title":"Mathematical Programming"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01759039","volume":"6","author":"C. Gonzaga","year":"1991","unstructured":"C. Gonzaga, \u201cSearch directions for interior linear programming methods,\u201dAlgorithmica 6 (1991) 153\u2013181.","journal-title":"Algorithmica"},{"key":"CR9","volume-title":"An $$O(\\sqrt n L)$$ -iteration large-step primal\u2014dual affine algorithm for linear programming","author":"C. Gonzaga","year":"1989","unstructured":"C. Gonzaga and M.J. Todd, \u201cAn $$O(\\sqrt n L)$$ -iteration large-step primal\u2014dual affine algorithm for linear programming,\u201d Technical Report 862, School of Operations Research and Industrial Engineering, Cornell University, (Ithaca, NY, 1989)."},{"key":"CR10","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":"CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, S. Mizuno, and A. Yoshise, \u201cAn $$O(\\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems,\u201dMathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF02592079","volume":"39","author":"M. Kojima","year":"1987","unstructured":"M. Kojima and Y. Ye. \u201cRecovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming,\u201dMathematical Programming 39 (1987) 305\u2013317.","journal-title":"Mathematical Programming"},{"key":"CR13","volume-title":"An extension of Karmarkar's algorithm for bounded linear programming problems","author":"A. Steger","year":"1985","unstructured":"A. Steger, \u201cAn extension of Karmarkar's algorithm for bounded linear programming problems,\u201d Master's Thesis, SUNY at Stonybrook (Stonybrook, NY, 1985)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01840455","volume":"1","author":"M. Todd","year":"1986","unstructured":"M. Todd and B. Burrell, \u201cAn extension of Karmarkar's algorithm for linear programming using dual variables,\u201dAlgorithmica 1 (1986) 409\u2013424.","journal-title":"Algorithmica"},{"key":"CR15","volume-title":"\u201cThe effects of sparsity, degeneracy, and null and unbounded variables in variants of Karmarkar's linear programming algorithm,\u201d Technical Report 857","author":"M.J. Todd","year":"1989","unstructured":"M.J. Todd, \u201cThe effects of sparsity, degeneracy, and null and unbounded variables in variants of Karmarkar's linear programming algorithm,\u201d Technical Report 857, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1989)."},{"key":"CR16","volume-title":"\u201cOn combined phase 1-phase 2 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 1-phase 2 projective methods for linear programming,\u201d Technical Report 877, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1989)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1287\/moor.15.3.508","volume":"15","author":"M.J. Todd","year":"1990","unstructured":"M.J. Todd and Y. Ye, \u201cA centered projective algorithm for linear programming,\u201dMathematics of Operations Research 15 (1990) 508\u2013529.","journal-title":"Mathematics of Operations Research"},{"key":"CR18","volume-title":"A unified approach to projective algorithms for linear programming","author":"J.-P. Vial","year":"1989","unstructured":"J.-P. Vial, \u201cA unified approach to projective algorithms for linear programming,\u201d in: Dolecki, ed., (Springer, Berlin, 1989)."},{"key":"CR19","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":"CR20","unstructured":"Y. Ye, \u201cA class of projective transformations for linear programming,\u201d to appear in:SIAM Journal on Computing (1991)."},{"key":"CR21","volume-title":"Line search in potential reduction algorithms for linear programming","author":"Y. Ye","year":"1989","unstructured":"Y. Ye, \u201cLine search in potential reduction algorithms for linear programming,\u201d Manuscript, Department of Management Sciences, The University of Iowa (Iowa City, IA, 1989)."},{"key":"CR22","volume-title":"Practical approaches to potential function method for linear programming","author":"Y. Ye","year":"1989","unstructured":"Y. Ye, \u201cPractical approaches to potential function method for linear programming,\u201d Manuscript, Integrated Systems Inc. (Santa Clara, CA, 1989)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582898.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582898\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582898","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\/BF01582898"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582898"],"URL":"https:\/\/doi.org\/10.1007\/bf01582898","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}