{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:36Z","timestamp":1747548336773},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"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":[[1994,2]]},"DOI":"10.1007\/bf01581697","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:42:27Z","timestamp":1114666947000},"page":"217-245","source":"Crossref","is-referenced-by-count":15,"title":["Interior-point algorithms for semi-infinite programming"],"prefix":"10.1007","volume":"65","author":[{"given":"Michael J.","family":"Todd","sequence":"first","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, M.G.C. Resende, G. Veiga and N. Karmarkar, \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":"160","DOI":"10.1137\/0723011","volume":"23","author":"E.L. Allgower","year":"1986","unstructured":"E.L. Allgower, K. B\u00f6hmer, F.A. Potra and W.C. Rheinboldt, \u201cA mesh-independence principle for operator equations and their discretizations,\u201dSIAM Journal on Numerical Analysis 23 (1986) 160\u2013169.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR3","volume-title":"Linear Programming in Infinite-Dimensional Spaces","author":"E.J. Anderson","year":"1987","unstructured":"E.J. Anderson and P. Nash,Linear Programming in Infinite-Dimensional Spaces (Wiley, Chichester, 1987)."},{"key":"CR4","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":"CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes, \u201cUA 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":"885","DOI":"10.1287\/opre.40.5.885","volume":"40","author":"R.E. Bixby","year":"1992","unstructured":"R.E. Bixby, J.W. Gregory, I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cVery large-scale linear programming: a case study in combining interior point and simplex methods,\u201dOperations Research 40 (1992) 885\u2013897.","journal-title":"Operations Research"},{"key":"CR7","series-title":"Working Paper","volume-title":"Some computational experience and a modification of the Karmarkar algorithm","author":"T.M. Cavalier","year":"1985","unstructured":"T.M. Cavalier and A.L. Soyster, \u201cSome computational experience and a modification of the Karmarkar algorithm,\u201d Working Paper 85-105, Dept. of Industrial and Management Systems Engineering, Pennsylvania State University, University Park, PA, 1985."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/BF02023060","volume":"22","author":"E. Christiansen","year":"1990","unstructured":"E. Christiansen and K.O. Kortanek, \u201cComputing material collapse displacement fields on a Cray X-MP\/48 by the LP primal affine scaling algorithm,\u201dAnnals of Operations Research 22 (1990) 355\u2013376.","journal-title":"Annals of Operations Research"},{"key":"CR9","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 Academiia Nauk SSSR 174 (1967) 747\u2013748.","journal-title":"Doklady Academiia Nauk SSSR"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF01582293","volume":"43","author":"M.C. Ferris","year":"1989","unstructured":"M.C. Ferris and A.B. Philpott, \u201cAn interior point algorithm for semi-infinite linear programming,\u201dMathematical Programming 43 (1989) 257\u2013276.","journal-title":"Mathematical Programming"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01580908","volume":"56","author":"M.C. Ferris","year":"1992","unstructured":"M.C. Ferris and A.B. Philpott, \u201cOn affine scaling and semi-infinite programming,\u201dMathematical Programming 56 (1992) 361\u2013364.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-6377(88)90045-4","volume":"7","author":"R.M. Freund","year":"1988","unstructured":"R.M. Freund, \u201cAn analog of Karmarkar's algorithm for inequality constrained linear programs, with a \u2018new\u2019 class of projective transformations for centering a polytope,\u201dOperations Research Letters 7 (1988) 9\u201313.","journal-title":"Operations Research Letters"},{"key":"CR13","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":"CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02591685","volume":"37","author":"D. Gay","year":"1987","unstructured":"D. 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":"CR15","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":"CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1142-6","volume-title":"Linear Optimization and Approximation","author":"K. Glashoff","year":"1983","unstructured":"K. Glashoff and S.-A. Gustafson,Linear Optimization and Approximation (Springer-Verlag, New York, 1983)."},{"key":"CR17","first-page":"73","volume-title":"Handbooks in Operations Research and Management Science, Vol. 1, Optimization","author":"D. Goldfarb","year":"1989","unstructured":"D. Goldfarb and M.J. Todd, \u201cLinear programming,\u201d in: G.L. Nemhauser, A.H.G. Rinnooy Kan, and M.J. Todd, eds.,Handbooks in Operations Research and Management Science, Vol. 1, Optimization (North-Holland, Amsterdam, 1989), pp. 73\u2013170."},{"key":"CR18","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":"CR19","first-page":"1","volume-title":"Progress in Mathematical Programming, Interior Point and Related Methods","author":"C.C. Gonzaga","year":"1989","unstructured":"C.C. Gonzaga, \u201cAn algorithm for solving linear programming programs in O(n 3 L) operations,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer-Verlag, New York, 1989), pp. 1\u201328."},{"key":"CR20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01759039","volume":"6","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cSearch directions for interior linear-programming methods,\u201dAlgorithmica 6 (1991) 153\u2013181.","journal-title":"Algorithmica"},{"key":"CR21","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 problems with inequality constraints,\u201dMathematical Programming 52 (1991) 209\u2013225.","journal-title":"Mathematical Programming"},{"key":"CR22","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":"CR23","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1137\/0801019","volume":"1","author":"C.C. Gonzaga","year":"1991","unstructured":"C.C. Gonzaga, \u201cLarge-steps 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":"CR24","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/BF01582902","volume":"52","author":"D. Hertog den","year":"1991","unstructured":"D. den Hertog and C. Roos, \u201cA survey of search directions in interior point methods for linear programming,\u201dMathematical Programming 52 (1991) 481\u2013509.","journal-title":"Mathematical Programming"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1137\/1035089","volume":"35","author":"R. Hettich","year":"1993","unstructured":"R. Hettich and K.O. Kortanek, \u201cSemi-infinite programming: theory, method and applications,\u201dSIAM Review 35 (1993) 380\u2013429.","journal-title":"SIAM Review"},{"key":"CR26","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":"CR27","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\u2014dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer-Verlag, New York, 1989), pp. 29\u201347."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA polynomial-time algorithm for a class of linear complementarity problems,\u201dMathematical Programming 44 (1989) 1\u201326.","journal-title":"Mathematical Programming"},{"key":"CR29","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 {nL} )$$ iteration potential reduction algorithm for linear complementarity problems,\u201dMathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0377-2217(87)90270-0","volume":"32","author":"K.O. Kortanek","year":"1987","unstructured":"K.O. Kortanek and M. Shi, \u201cConvergence results and numerical experiments on a linear programming hybrid algorithm,\u201dEuropean Journal of Operational Research 32 (1987) 47\u201361.","journal-title":"European Journal of Operational Research"},{"key":"CR31","unstructured":"E. Kranich, \u201cInterior point methods for mathematical programming: a bibliography,\u201d Discussion Paper 171, Institute of Economics and Operations Research, Fern University Hagen, Hagen, Germany (also available via netlib)."},{"key":"CR32","first-page":"70","volume-title":"Large-Scale Numerical Optimization","author":"I.J. Lustig","year":"1990","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cThe primal\u2014dual interior point method on the Cray supercomputer,\u201d in: T.F. Coleman and Y. Li, eds.,Large-Scale Numerical Optimization (SIAM, Philadelphia, 1990), pp. 70\u201380."},{"key":"CR33","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"S. Mizuno, M.J. Todd,, and Y. Ye, \u201cOn adaptive step primal\u2014dual interior-point algorithms for linear programming,\u201dMathematics of Operations Research 18 (1993) 964\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(87)90040-X","volume":"6","author":"C. Monma","year":"1987","unstructured":"C. Monma and A. 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":"CR35","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 algorithms. Part I: Linear programming,\u201dMathematical Programming 44 (1989) 27\u201342.","journal-title":"Mathematical Programming"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"R.C. Monteiro and I. Adler, \u201cInterior path following primal\u2014dual algorithms. Part II: Convex quadratic programming,\u201dMathematical Programming 44 (1989) 43\u201366.","journal-title":"Mathematical Programming"},{"key":"CR37","first-page":"165","volume":"26","author":"M.J.D. Powell","year":"1990","unstructured":"M.J.D. Powell, \u201cKarmarkar's algorithm: a view from nonlinear programming,\u201dBulletin of the Institute of Mathematics and its Applications 26 (1990) 165\u2013181.","journal-title":"Bulletin of the Institute of Mathematics and its Applications"},{"key":"CR38","first-page":"143","volume-title":"Numerical Analysis 1991, Pitman Research Notes in Mathematics 260","author":"M.J.D. Powell","year":"1992","unstructured":"M.J.D. Powell, \u201cThe complexity of Karmarkar's algorithm for linear programming,\u201d in: D.F. Griffiths and G.A. Watson, eds.,Numerical Analysis 1991, Pitman Research Notes in Mathematics 260 (Longman, Burnt Hill, UK, 1992), pp. 143\u2013163."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01585165","volume":"62","author":"M.J.D. Powell","year":"1993","unstructured":"M.J.D. Powell, \u201cOn the number of iterations of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 62 (1993) 153\u2013197.","journal-title":"Mathematical Programming"},{"key":"CR40","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\u201394.","journal-title":"Mathematical Programming"},{"key":"CR41","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","volume":"54","author":"C. Roos","year":"1992","unstructured":"C. Roos and J.-P. Vial, \u201cA polynomial method of approximate centers for linear programming,\u201dMathematical Programming 54 (1992) 295\u2013305.","journal-title":"Mathematical Programming"},{"key":"CR42","first-page":"19","volume":"63","author":"G. Sonnevend","year":"1989","unstructured":"G. Sonnevend, J. Stoer and G. Zhao, \u201cOn the complexity of following the central path of linear programs by linear extrapolation,\u201dMethods of Operations Research 63 (1989) 19\u201331.","journal-title":"Methods of Operations Research"},{"key":"CR43","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 M.S. Thesis, SUNY at Stonybrook, New York (1985)."},{"key":"CR44","first-page":"197","volume-title":"System Modelling and Optimization, Lecture Notes in Control and Information Sciences 113","author":"K. Tanabe","year":"1988","unstructured":"K. Tanabe, \u201cCentered Newton method for mathematical programming,\u201d in: M. Iri and K. Yajima, eds.,System Modelling and Optimization, Lecture Notes in Control and Information Sciences 113 (Springer-Verlag, Berlin, 1988), pp. 197\u2013206."},{"key":"CR45","first-page":"109","volume-title":"Mathematical Programming: 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: Recent Developments and Applications (Kluwer Academic Press, Dordrecht, The Netherlands, 1989), pp. 109\u2013157."},{"key":"CR46","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":"CR47","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":"CR48","volume-title":"\u201cAsymptotic behavior of interior-point methods: a view from semi-infinite programming,\u201d Technical Report No. 1031","author":"L. Tuncel","year":"1992","unstructured":"L. Tuncel and M.J. Todd, \u201cAsymptotic behavior of interior-point methods: a view from semi-infinite programming,\u201d Technical Report No. 1031, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1992."},{"key":"CR49","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.5n)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013202.","journal-title":"Mathematical Programming"},{"key":"CR50","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":"CR51","series-title":"Working paper","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 Working paper, Mathematical Systems Institute, Inc., Tokyo, Japan, 1986."},{"key":"CR52","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":"CR53","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\/BF01581697.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581697\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:20Z","timestamp":1556881940000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581697"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":53,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["BF01581697"],"URL":"https:\/\/doi.org\/10.1007\/bf01581697","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}