{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T05:53:20Z","timestamp":1713246800893},"reference-count":45,"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\/bf01582902","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:35:11Z","timestamp":1114662911000},"page":"481-509","source":"Crossref","is-referenced-by-count":53,"title":["A survey of search directions in interior point methods for linear programming"],"prefix":"10.1007","volume":"52","author":[{"given":"D.","family":"den Hertog","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Roos","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":"1989","unstructured":"I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 44 (1989) 297\u2013335.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/BF01840458","volume":"1","author":"K.M. Anstreicher","year":"1985","unstructured":"K.M. Anstreicher, \u201cA monotonic projective algorithm for fractional linear programming,\u201dAlgorithmica 1 (1985) 483\u2013498.","journal-title":"Algorithmica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01580868","volume":"47","author":"K.M. Anstreicher","year":"1990","unstructured":"K.M. Anstreicher, \u201cA standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm,\u201dMathematical Programming 47 (1990) 337\u2013351.","journal-title":"Mathematical Programming"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"K.M. Anstreicher and R.A. Bosch, \u201cLong steps in an O(n 3 L) algorithm for linear programming,\u201d to appear in:Mathematical Programming (1992).","DOI":"10.1007\/BF01586053"},{"key":"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":"CR6","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.-Ph. Vial, \u201cA polynomial Newton method for linear programming,\u201dAlgorithmica 1 (1986) 425\u2013453.","journal-title":"Algorithmica"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0024-3795(91)90266-Y","volume":"152","author":"D. Hertog Den","year":"1991","unstructured":"D. Den Hertog, C. Roos and T. Terlaky, \u201cA potential reduction variant of Renegar's short-step path-following method for linear programming,\u201dLinear Algebra and its Applications 152 (1991) 43\u201368.","journal-title":"Linear Algebra and its Applications"},{"key":"CR8","first-page":"747","volume":"174","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dDoklady Akademiia Nauk SSSR 174 (1967) 747\u2013748.","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"CR9","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":"CR10","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":"CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"key":"CR12","first-page":"1","volume-title":"Progress in Mathematical Programming, Interior Point and Related Methods","author":"C.C. Gonzaga","year":"1988","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1988) pp. 1\u201328."},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"C.C. Gonzaga, \u201cSearch directions for interior linear programming methods,\u201d to appear in:Algorithmica (1991).","DOI":"10.1007\/BF01759039"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01582888","volume":"52","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cInterior point algorithms for linear programming with inequality constraints,\u201dMathematical Programming (Series B) 52 (1991) 209\u2013225.","journal-title":"Mathematical Programming (Series B)"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF01588776","volume":"49","author":"C.C. Gonzaga","year":"1990","unstructured":"C.C. Gonzaga, \u201cPolynomial affine algorithms for linear programming,\u201dMathematical Programming 49 (1990) 7\u201321.","journal-title":"Mathematical Programming"},{"key":"CR16","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":"CR17","doi-asserted-by":"crossref","unstructured":"C.C. Gonzaga, \u201cLarge-step path-following methods for linear programming, Part I: barrier function method,\u201dSIAM Journal on Optimization 1 (1991).","DOI":"10.1137\/0801018"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"C.C. Gonzaga, \u201cLarge-step path-following methods for linear programming, Part II: potential reduction method,\u201dSIAM Journal on Optimization 1 (1991).","DOI":"10.1137\/0801019"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01580721","volume":"40","author":"H. Imai","year":"1988","unstructured":"H. Imai, \u201cOn the convexity of the multiplicative version of Karmarkar's potential function,\u201dMathematical Programming 40 (1988) 29\u201332.","journal-title":"Mathematical Programming"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BF01840457","volume":"1","author":"M. Iri","year":"1986","unstructured":"M. Iri and H. Imai, \u201cA multiplicative barrier function method for linear programming,\u201dAlgorithmica 1 (1986) 455\u2013482.","journal-title":"Algorithmica"},{"key":"CR21","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":"CR22","first-page":"29","volume-title":"Progress in Mathematical Programming, Interior Point and Related Methods","author":"M. Kojima","year":"1988","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal\u2014dual interior point algorithm for linear programming,\u201d in: N. Meggido, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1988) pp. 29\u201347."},{"key":"CR23","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"},{"issue":"1","key":"CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/moor.14.1.97","volume":"14","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo and M. Shub, \u201cBoundary behavior of interior point algorithms in linear programming,\u201dMathematics of Operations Research 14(1) (1989) 97\u2013146.","journal-title":"Mathematics of Operations Research"},{"key":"CR25","first-page":"237","volume-title":"Contributions to Operations Research and Economics","author":"J.E. Mitchell","year":"1989","unstructured":"J.E. Mitchell and M.J. Todd, \u201cOn the relationship between the search directions in the affine and projective variants of Karmarkar's linear programming algorithm,\u201d in: B. Cornet and H. Tulkens, eds.,Contributions to Operations Research and Economics (MIT Press, Cambridge, MA, 1989) pp. 237\u2013250."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(87)90040-X","volume":"6","author":"C.L. Monma","year":"1987","unstructured":"C.L. Monma and J. Morton, \u201cComputational experience with a dual affine variant of Karmarkar's method for linear programming,\u201dOperations Research Letters 6 (1987) 261\u2013267.","journal-title":"Operations Research Letters"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"R.C. Monteiro and I. Adler, \u201cInterior path-following primal\u2014dual algorithm. Part I: Linear programming,\u201dMathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"issue":"2","key":"CR28","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R.D.C. Monteiro","year":"1990","unstructured":"R.D.C. Monteiro, I. Adler and M.G.C. Resende, \u201cA polynomial-time primal\u2014dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,\u201dMathematics of Operations Research 15(2) (1990) 191\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm, based on Newton's method, for linear programming,\u201dMathematical Programming 40 (1988) 59\u201393.","journal-title":"Mathematical Programming"},{"issue":"3","key":"CR30","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/BF00939806","volume":"63","author":"C. Roos","year":"1987","unstructured":"C. Roos, \u201cA new, trajectory following polynomial-time algorithm for the linear programming problem,\u201dJournal on Optimization Theory and is Applications 63(3) (1987) 433\u2013458.","journal-title":"Journal on Optimization Theory and is Applications"},{"key":"CR31","first-page":"147","volume-title":"Proceedings of the Fifth French\u2014German Conference. Lecture Notes in Mathematics No. 1405","author":"C. Roos","year":"1989","unstructured":"C. Roos, \u201cAn O(n 3 L) approximate center method for linear programming,\u201d in: S. Dolecki, ed.,Proceedings of the Fifth French\u2014German Conference. Lecture Notes in Mathematics No. 1405 (Springer, Berlin, 1989) pp. 147\u2013158."},{"key":"CR32","volume-title":"\u201cA polynomial method of approximate weighted centers for linear programming,\u201d Report No. 89-13","author":"C. Roos","year":"1989","unstructured":"C. Roos and D. Den Hertog, \u201cA polynomial method of approximate weighted centers for linear programming,\u201d Report No. 89-13, Faculty of Mathematics and Informatics\/Computer Science, Delft University of Technology (Delft, Netherlands, 1989)."},{"key":"CR33","volume-title":"\u201cAnalytic centers in linear programming,\u201d Report No. 88-74","author":"C. Roos","year":"1988","unstructured":"C. Roos and J.-Ph. Vial, \u201cAnalytic centers in linear programming,\u201d Report No. 88-74, Faculty of Mathematics and Informatics\/Computer Science, Delft University of Technology (Delft, Netherlands, 1988)."},{"key":"CR34","doi-asserted-by":"crossref","unstructured":"C. Roos and J.-Ph. Vial, \u201cA polynomial method of approximate centers for linear programming,\u201d to appear in:Mathematical Programming (1992).","DOI":"10.1007\/BF01586056"},{"key":"CR35","first-page":"433","volume-title":"Economic Decision-making: Games, Economics and Optimisation. Contributions in Honour of Jacques H. Dr\u00e8ze","author":"C. Roos","year":"1990","unstructured":"C. Roos and J.-Ph. Vial, \u201cLong steps with the logarithmic penalty barrier function in linear programming,\u201d in: J. Gabszewicz, J.-F. Richard and L. Wolsey, eds.,Economic Decision-making: Games, Economics and Optimisation. Contributions in Honour of Jacques H. Dr\u00e8ze (Elsevier Science Publisher, Amsterdam, 1990) pp. 433\u2013441."},{"key":"CR36","first-page":"109","volume-title":"Mathematical Programming \u2014 Recent Developments and Applications","author":"M.J. Todd","year":"1989","unstructured":"M.J. Todd, \u201cRecent developments and new directions in linear programming,\u201d in: M. Iri and K. Tanabe, eds.,Mathematical Programming \u2014 Recent Developments and Applications (Kluwer Academic Publishers, Dordrecht, 1989) pp. 109\u2013157."},{"key":"CR37","volume-title":"\u201cThe affine-scaling direction for linear programming is a limit of projective-scaling directions,\u201d Technical Report 834","author":"M.J. Todd","year":"1988","unstructured":"M.J. Todd, \u201cThe affine-scaling direction for linear programming is a limit of projective-scaling directions,\u201d Technical Report 834, School of Operations Research and Industrial Engineering, College of Engineering, Cornell University (Ithaca, NY, 1988)."},{"key":"CR38","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":"CR39","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P.M. Vaidya","year":"1990","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O(((m+n)n 2 +(m+n) 1.5 n)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013201.","journal-title":"Mathematical Programming"},{"key":"CR40","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"},{"key":"CR41","volume-title":"A polynomially and quadratically convergent method for linear programming","author":"H. Yamashita","year":"1986","unstructured":"H. Yamashita, \u201cA polynomially and quadratically convergent method for linear programming,\u201d Mathematical Systems Institute (Tokyo, Japan, 1986)."},{"key":"CR42","series-title":"Working paper","volume-title":"A class of potential functions for linear programming","author":"Y. Ye","year":"1988","unstructured":"Y. Ye, \u201cA class of potential functions for linear programming,\u201d Working paper 88-13, Department of Management Sciences, The University of Iowa (Iowa City, IA, 1988)."},{"key":"CR43","unstructured":"Y. Ye, \u201cA class of projective transformations for linear programming,\u201d to appear in:SIAM Journal on Computing (1991)."},{"key":"CR44","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 basis is Karmarkar's polynomial algorithm for linear programming,\u201dMathematical Programming 39 (1987) 305\u2013317.","journal-title":"Mathematical Programming"},{"key":"CR45","volume-title":"Search directions for projective methods","author":"U. Zimmermann","year":"1988","unstructured":"U. Zimmermann, \u201cSearch directions for projective methods,\u201d Abteilung f\u00fcr Mathematische Optimierung, Institut f\u00fcr Angewandte Mathematik, Technische Universit\u00e4t Carolo-Wilhelmina (Braunschweig, Germany, 1988)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582902.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582902\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582902","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:15:56Z","timestamp":1556882156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582902"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":45,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582902"],"URL":"https:\/\/doi.org\/10.1007\/bf01582902","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}