{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:11:21Z","timestamp":1787314281186,"version":"3.56.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":[[1990,11]]},"DOI":"10.1007\/bf01588796","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:19:53Z","timestamp":1114676393000},"page":"341-358","source":"Crossref","is-referenced-by-count":37,"title":["On the convergence of the method of analytic centers when applied to convex quadratic programs"],"prefix":"10.1007","volume":"49","author":[{"given":"F.","family":"Jarre","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The nonlinear geometry of linear programming","author":"D.A. Bayer","year":"1986","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming,\u201d Preprints, AT&T Bell Laboratories (Murray Hills, NJ, 1986)."},{"key":"CR2","volume-title":"\u201cPolynomial barrier function algorithm for linear programming,\u201d Technical report J 88-4","author":"M.B. Daya","year":"1987","unstructured":"M.B. Daya and C.M. Shetty, \u201cPolynomial barrier function algorithm for linear programming,\u201d Technical report J 88-4, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1987)."},{"key":"CR3","volume-title":"\u201cPolynomial barrier function algorithm for convex quadratic programming,\u201d Technical report J 88-5","author":"M.B. Daya","year":"1988","unstructured":"M.B. Daya and C.M. Shetty, \u201cPolynomial barrier function algorithm for convex quadratic programming,\u201d Technical report J 88-5, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1988)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1287\/mnsc.10.4.601","volume":"10","author":"A.V. Fiacco","year":"1964","unstructured":"A.V. Fiacco and G.P. McCormick, \u201cThe sequential unconstrained minimization technique (SUMT) for nonlinear programming, a primal\u2014dual method,\u201dManagement Science 10 (1964) 601\u2013617.","journal-title":"Management Science"},{"key":"CR5","volume-title":"\u201cProjective transformations for interior point methods, Part I: Basic theory and linear programming,\u201d Working paper OR 179-88","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, Massachusetts Institute of Technology (Boston, MA, 1988)."},{"key":"CR6","series-title":"Working paper","volume-title":"Projective transformations for interior point methods, Part II: Analysis of an algorithm for finding the weighted center of a polyhedral system","author":"R.M. Freund","year":"1988","unstructured":"R.M. Freund, \u201cProjective transformations for interior point methods, Part II: Analysis of an algorithm for finding the weighted center of a polyhedral system,\u201d Working paper OR 180-88, Massachusetts Institute of Technology (Boston, MA, 1988)."},{"key":"CR7","volume-title":"\u201cThe logarithmic potential method of convex programming,\u201d Technical report","author":"K.R. Frisch","year":"1955","unstructured":"K.R. Frisch, \u201cThe logarithmic potential method of convex programming,\u201d Technical report, University Institute of Economics (Oslo, Norway, 1955)."},{"key":"CR8","volume-title":"CORE Discussion Paper No 8744","author":"J.L. Goffin","year":"1987","unstructured":"J.L. Goffin, \u201cAffine methods in nondifferentiable optimization,\u201dCORE Discussion Paper No 8744 (Center of Operations Research & Econometrics, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1987)."},{"key":"CR9","volume-title":"\u201cAn O(n 3 L) primal interior point algorithm for convex quadratic programming,\u201d Technical report","author":"D. Goldfarb","year":"1988","unstructured":"D. Goldfarb and S. Liu, \u201cAn O(n 3 L) primal interior point algorithm for convex quadratic programming,\u201d Technical report, Dept. of IEOR, Columbia University (New York, NY, 1988)."},{"key":"CR10","first-page":"1","volume-title":"Progress in Mathematical Programming","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 (Springer, Berlin, 1988) pp. 1\u201328."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BF02165238","volume":"8","author":"P. Huard","year":"1966","unstructured":"P. Huard and B.T. Li\u00eau, \u201cLa m\u00e9thode des centres dans un espace topologique,\u201d Numerische Mathematik 8 (1966) 56\u201367.","journal-title":"Numerische Mathematik"},{"key":"CR12","unstructured":"F. Jarre, \u201cOn the convergence of the method of analytic centers when applied to convex quadratic programs,\u201d Report No. 35, Schwerpunktprogramm der DFG Anwendungsbezogene Optimierung und Steuerung, Institut f\u00fcr Angewandte Mathematik und Statistik, Universit\u00e4t W\u00fcrzburg (1987)."},{"key":"CR13","first-page":"69","volume-title":"Optimization. Lecture Notes in Mathematics, No. 1405","author":"F. Jarre","year":"1989","unstructured":"F. Jarre, \u201cOn the method of analytic centers for solving smooth convex programs,\u201d in: S. Dolecki, ed.,Optimization. Lecture Notes in Mathematics, No. 1405 (Springer, Berlin, 1989) pp. 69\u201385."},{"key":"CR14","first-page":"297","volume-title":"Lecture Notes in Control and Information Sciences, No. 111","author":"F. Jarre","year":"1988","unstructured":"F. Jarre, G. Sonnevend, J. Stoer, \u201cAn implementation of the method of analytic centers,\u201d in: A. Benoussan, J.L. Lions, eds.,Lecture Notes in Control and Information Sciences, No. 111 (Springer, Berlin, 1988) pp. 297\u2013307."},{"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","doi-asserted-by":"crossref","unstructured":"S. Kapoor and P.M. Vaidya, \u201cFast algorithms for convex quadratic programming and multicommodity flows,\u201dJournal of the ACM (1986) 147\u2013159.","DOI":"10.1145\/12130.12145"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01582283","volume":"43","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and T. Noma, \u201cA new continuation method for complementarity problems with uniformP-functions,\u201dMathematical Programming 43 (1989) 107\u2013113.","journal-title":"Mathematical Programming"},{"key":"CR18","unstructured":"G.P. McCormick, \u201cMiscellaneous results concerning Karmarkar's projective method and SUMT,\u201d Manuscript GWU\/IMSE\/Serial T-519\/87, Institute for Management Science and Engineering, The George Washington University (1987)."},{"key":"CR19","first-page":"131","volume-title":"Progress in Mathematical Programming","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.Progress in Mathematical Programming (Springer, Berlin, 1988) pp. 131\u2013158."},{"key":"CR20","volume-title":"\u201cAn algorithm for convex quadratic programming that requires O(n 3.5 L) arithmetic operations,\u201d Technical report 87-24","author":"S. Mehrotra","year":"1987","unstructured":"S. Mehrotra and J. Sun, \u201cAn algorithm for convex quadratic programming that requires O(n 3.5 L) arithmetic operations,\u201d Technical report 87-24, Dept. of IE\/MS, Northwestern University (Evaston IL, 1987)."},{"key":"CR21","volume-title":"\u201cA method of analytic centers for quadratically constrained quadratic programs,\u201d Technical report 88-01","author":"S. Mehrotra","year":"1988","unstructured":"S. Mehrotra and J. Sun, \u201cA method of analytic centers for quadratically constrained quadratic programs,\u201d Technical report 88-01, Dept. of IE\/MS, Northwestern University (Evanston, IL, 1988)."},{"key":"CR22","volume-title":"\u201cAn interior point algorithm for solving smooth convex programs based on Newton's method,\u201d Technical report 88-08","author":"S. Mehrotra","year":"1988","unstructured":"S. Mehrotra and J. Sun, \u201cAn interior point algorithm for solving smooth convex programs based on Newton's method,\u201d Technical report 88-08, Dept of IE\/MS, Northwestern University (Evanston, IL, 1988)."},{"key":"CR23","volume-title":"\u201cAn O(n 3) primal\u2014dual interior point algorithm for linear programming,\u201d Report ORC 87-4 Operations Research Center","author":"R.C. Monteiro","year":"1987","unstructured":"R.C. Monteiro and I. Adler, \u201cAn O(n 3) primal\u2014dual interior point algorithm for linear programming,\u201d Report ORC 87-4 Operations Research Center, Dept. of Operations Research, University of California (Berkeley, CA, 1987)."},{"key":"CR24","volume-title":"\u201cAn O(n 3) primal-dual interior point algorithm for convex quadratic programming,\u201d Report ORC 87-15 Operations Research Center","author":"R.C. Monteiro","year":"1987","unstructured":"R.C. Monteiro and I. Adler, \u201cAn O(n 3) primal-dual interior point algorithm for convex quadratic programming,\u201d Report ORC 87-15 Operations Research Center, Dept. of Operations Research, University of California (Berkeley, CA, 1987)."},{"key":"CR25","volume-title":"A general approach to polynomial-time algorithms design for convex programming,\u201d Report","author":"J.E. Nesterov","year":"1988","unstructured":"J.E. Nesterov and A.S. Nemirovsky, \u201cA general approach to polynomial-time algorithms design for convex programming,\u201d Report, Central Economical and Mathematical Institute, USSR Academy of Sciences (Moscow, USSR, 1988)."},{"key":"CR26","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"},{"key":"CR27","volume-title":"\u201cA polynomial method of approximate centers for linear programming,\u201d Report 88-68","author":"C. Roos","year":"1988","unstructured":"C. Roos and J.Ph. Vial, \u201cA polynomial method of approximate centers for linear programming,\u201d Report 88-68, Delft University of Technology (Delft, The Netherlands, 1988)."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1007\/BFb0043914","volume":"84","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, \u201cAn analytical centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201dLecture Notes in Control and Information Sciences, No.84 (1985) pp. 866\u2013876.","journal-title":"Lecture Notes in Control and Information Sciences"},{"key":"CR29","unstructured":"G. Sonnevend and J. Stoer, \u201cGlobal ellipsoidal approximations and homotopy methods for solving convex analytic programs,\u201d to appear inApplied Mathematics and Optimization (1988)."},{"key":"CR30","volume-title":"An algorithm for solving linear programming which requires O(((m+n)n 2+(m+n) 1.5 n)L) arithmetic operations","author":"P.M. Vaidya","year":"1987","unstructured":"P.M. Vaidya, \u201cAn algorithm for solving linear programming which requires O(((m+n)n 2+(m+n) 1.5 n)L) arithmetic operations,\u201d preprint AT&T Bell Laboratories (Murray Hills, NJ, 1987)."},{"key":"CR31","unstructured":"C. Witzgall, P.T. Boggs and P.D. Domich, \u201cOn center trajectories and their relatives in linear programming,\u201d Technical report, National Bureau of Standards (1988)."},{"key":"CR32","volume-title":"Further development on the interior algorithm for convex quadratic programming","author":"Y. Ye","year":"1987","unstructured":"Y. Ye, \u201cFurther development on the interior algorithm for convex quadratic programming,\u201d Manuscript, Dept. of Engineering-Economic Systems, Stanford University (Stanford, CA, 1987)."},{"key":"CR33","volume-title":"Containing and shrinking ellipsoids in the path \u2014 following algorithm,\u201d Report","author":"Y. Ye","year":"1987","unstructured":"Y. Ye and M. Todd, \u201cContaining and shrinking ellipsoids in the path \u2014 following algorithm,\u201d Report, Dept. of Engineering-Economic Systems, Stanford University, and Dept. of OR and Industrial Engineering, Cornell University (Ithaca, NY, 1987)."},{"key":"CR34","volume-title":"A polynomial-time algorithm for convex quadratic programming,\u201d Report","author":"Y. Ye","year":"1986","unstructured":"Y. Ye and E. Tse, \u201cA polynomial-time algorithm for convex quadratic programming,\u201d Report, Dept. of Engineering-Economic Systems, Stanford University (Stanford, CA, 1986)."},{"key":"CR35","volume-title":"International Series of Numerical Mathematics, No. 84","author":"U. Zimmermann","year":"1988","unstructured":"U. Zimmermann, \u201cOn recent developments in linear programming,\u201d in:International Series of Numerical Mathematics, No. 84 (Birkh\u00e4user Verlag, Basel, 1988)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588796.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588796\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588796","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T00:01:47Z","timestamp":1586217707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588796"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":35,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF01588796"],"URL":"https:\/\/doi.org\/10.1007\/bf01588796","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}