{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T15:03:48Z","timestamp":1785251028002,"version":"3.55.0"},"reference-count":25,"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\/bf01582904","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"527-553","source":"Crossref","is-referenced-by-count":46,"title":["On the complexity of following the central path of linear programs by linear extrapolation II"],"prefix":"10.1007","volume":"52","author":[{"given":"G.","family":"Sonnevend","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Stoer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"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","volume-title":"Affine Differentialgeometrie","author":"W. Blaschke","year":"1924","unstructured":"W. Blaschke and K. Reidmeister,Affine Differentialgeometrie (Springer, Berlin, 1924)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/ijoc.1.3.159","volume":"1","author":"P.T. Boggs","year":"1989","unstructured":"P.T. Boggs, P.D. Domich, J.R. Donaldson and C. Witzgall, \u201cAlgorithmic enhancements to the method of centers for linear programming,\u201dORSA Journal on Computing 1 (1989) 159\u2013171.","journal-title":"ORSA Journal on Computing"},{"key":"CR4","volume-title":"\u201cOptimal 3-dimensional methods for linear programming,\u201d Tehcnical Report NISTIR 89-4225","author":"P.T. Boggs","year":"1989","unstructured":"P.T. Boggs, P.D. Domich, J.R. Donaldson and C. Witzgall, \u201cOptimal 3-dimensional methods for linear programming,\u201d Tehcnical Report NISTIR 89-4225, National Institute of Standards and Technology (Gaithersburg, MD, 1989)."},{"key":"CR5","volume-title":"Decomposition and nondifferentiable optimization with the projective algorithm","author":"J.L. Goffin","year":"1989","unstructured":"J.L. Goffin, A. Haurie and J.P. Vial, \u201cDecomposition and nondifferentiable optimization with the projective algorithm,\u201d Preprint G-89-25, Faculty of Manamgement, McGill University (Montreal, Que., 1989)."},{"key":"CR6","first-page":"1","volume-title":"Progress in Mathematical Programming, Interior Point and Related Methods","author":"Cl. Gonzaga","year":"1988","unstructured":"Cl. Gonzaga, \u201cAn algorithm for solving linear programming problems in O(n 3 L) operations,\u201d in: N. Meggido, ed.,Progress in Mathematical Programming, Interior Point and Related Methods (Springer, New York, 1988) pp. 1\u201328."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/BF01582903","volume":"52","author":"M. Iri","year":"1991","unstructured":"M. Iri, \u201cIntegrability of vector and multivector fields associated with interior point methods for linear programming,\u201dMathematical Programming (Series B) 52 (1991) 511\u2013525, this issue.","journal-title":"Mathematical Programming (Series B)"},{"key":"CR8","first-page":"69","volume-title":"Optimization, Proceedings of the Fifth French\u2014German Conference. Lecture Notes in Mathematics No. 1405","author":"Fl. Jarre","year":"1989","unstructured":"Fl. Jarre, \u201cOn the method of analytic centers for solving smooth, convex programs,\u201d in: S. Dolecki, ed.,Optimization, Proceedings of the Fifth French\u2014German Conference. Lecture Notes in Mathematics No. 1405 (Springer, Berlin, 1989) pp. 69\u201385."},{"key":"CR9","first-page":"297","volume-title":"Analysis and Optimization of Systems. Lecture Notes in Control and Information Sciences No. 111","author":"Fl. Jarre","year":"1988","unstructured":"Fl. Jarre, G. Sonnevend and J. Stoer, \u201cAn implementation of the method of analytic centers,\u201d in: A. Bensoussan and J.L. Lions, eds.,Analysis and Optimization of Systems. Lecture Notes in Control and Information Sciences No. 111 (Springer, Berlin, 1988) pp. 297\u2013307."},{"key":"CR10","unstructured":"N. Karmarkar, \u201cRiemannian geometry underlying interior point methods,\u201d Lecture and Preprint presented at the13th International Symposium on Mathematical Programming, Tokyo (Tokyo, 1988)."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, Sh. 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","volume-title":"\u201cComputational experience with a primal-dual interior point method for linear programming,\u201d Technical Report SOR 89-17","author":"I.J. Lustig","year":"1989","unstructured":"I.J. Lustig, R.E. Marsten and D.E. Shanno, \u201cComputational experience with a primal-dual interior point method for linear programming,\u201d Technical Report SOR 89-17, School of Engineering and Applied Science, Princeton University (Princeton, NJ, 1989)."},{"key":"CR13","doi-asserted-by":"crossref","DOI":"10.2172\/6005795","volume-title":"Primal barrier methods for linear programming","author":"A. Marxen","year":"1989","unstructured":"A. Marxen, \u201cPrimal barrier methods for linear programming,\u201d Ph.D. Thesis, Department of Operations Research, Stanford University (Stanford, CA, 1989)."},{"key":"CR14","volume-title":"\u201cImplementation of a first order central path following algorithm for solving large linear programs,\u201d Report No. 202","author":"J. Mennicken","year":"1990","unstructured":"J. Mennicken, \u201cImplementation of a first order central path following algorithm for solving large linear programs,\u201d Report No. 202, Institut f\u00fcr Angewandte Mathematik und Statistisk, Universit\u00e4t W\u00fcrzburg (W\u00fcrzburg, 1990)."},{"key":"CR15","volume-title":"\u201cAnticipated behaviour of path-following algorithms for linear programming,\u201d Technical Report No. 878-1989","author":"S. Mizuno","year":"1989","unstructured":"S. Mizuno, M.J. Todd and Y. Ye, \u201cAnticipated behaviour of path-following algorithms for linear programming,\u201d Technical Report No. 878-1989, School of Operations Research and Industrial Engineering, Cornell University (Ithaca, NY, 1989)."},{"key":"CR16","volume-title":"Self-Concordant Functions and Polynomial-Time Algorithms for Convex Programming","author":"Ju. Nesterov","year":"1989","unstructured":"Ju. Nesterov and A. Nemirovskii,Self-Concordant Functions and Polynomial-Time Algorithms for Convex Programming (Central Economical and Mathematical Institute USSR Academy of Science, Moscow, 1989)."},{"key":"CR17","doi-asserted-by":"crossref","unstructured":"C. Roos and J.-Ph. Vial, \u201cA polynomial method of approximate weighted centers for linear programming,\u201d to appear in:Mathematical Programming (1992).","DOI":"10.1007\/BF01586056"},{"key":"CR18","first-page":"271","volume-title":"Control of Uncertain Systems","author":"G. Sonnevend","year":"1989","unstructured":"G. Sonnevend, \u201cApplication of analytic centers to feedback design for systems with uncertainties,\u201d in: D. Hinrichsen and B. Martensson, eds.,Control of Uncertain Systems (Birkh\u00e4user, Basel, 1989) pp. 271\u2013289."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF01904781","volume":"10","author":"G. Sonnevend","year":"1984","unstructured":"G. Sonnevend, \u201cSequential algorithms of optimal order global error for the uniform recovery of functions with monotonerth derivatives,\u201dAnalysis Mathematica 10 (1984) 311\u2013335.","journal-title":"Analysis Mathematica"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01445161","volume":"21","author":"G. Sonnevend","year":"1989","unstructured":"G. Sonnevend and J. Stoer, \u201cGlobal ellipsoidal approximations and homotopy methods,\u201dApplied Mathematics and Optimization 21 (1989) 139\u2013166.","journal-title":"Applied Mathematics and Optimization"},{"key":"CR21","first-page":"19","volume":"62","author":"G. Sonnevend","year":"1990","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 62 (1990) 19\u201331.","journal-title":"Methods of Operations Research"},{"key":"CR22","first-page":"109","volume-title":"Mathematical Programming \u2014 Recent Developments and Applications","author":"M. Todd","year":"1989","unstructured":"M. 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\u2014Boston\u2014London, 1989) pp. 109\u2013157."},{"key":"CR23","unstructured":"C. Witzgall, P.T. Boggs and P.D. Domich, \u201cOn the convergence behavior of trajectories for linear programming,\u201d to appear in:Proceedings of the AMS-IME-SIAM Research Conference on \u201cMathematical Developments Arising from Linear Programming Algorithms,\u201d June 26\u201330, 1988, Bowdoin College (Brunswick, ME)."},{"key":"CR24","volume-title":"A class of potential functions for linear programming","author":"Y. Ye","year":"1988\/1989","unstructured":"Y. Ye, \u201cA class of potential functions for linear programming,\u201d Preprint, Department of Management Science, The University of Iowa (Iowa City, IA, 1988\/1989)."},{"key":"CR25","volume-title":"\u201cEstimating the complexity of path following methods for solving linear programs by curvature integrals,\u201d Technical Report No. 225","author":"G. Zhao","year":"1990","unstructured":"G. Zhao and J. Stoer, \u201cEstimating the complexity of path following methods for solving linear programs by curvature integrals,\u201d Technical Report No. 225, Institut f\u00fcr Angewandte Mathematik und Statistik, Universit\u00e4t W\u00fcrzburg (W\u00fcrzburg, 1990)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582904.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582904\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T02:31:07Z","timestamp":1625884267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582904"],"URL":"https:\/\/doi.org\/10.1007\/bf01582904","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}