{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T18:12:18Z","timestamp":1735582338015},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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,3]]},"DOI":"10.1007\/bf01582568","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:39:29Z","timestamp":1114663169000},"page":"123-147","source":"Crossref","is-referenced-by-count":17,"title":["A globally convergent primal\u2014dual interior point algorithm for convex programming"],"prefix":"10.1007","volume":"64","author":[{"given":"Renato D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertsekas","year":"1982","unstructured":"D.P. Bertsekas,Constrained Optimization and Lagrange Multiplier Methods (Academic Press, London, 1982)."},{"key":"CR2","first-page":"243","volume":"26","author":"R.S. Dembo","year":"1978","unstructured":"R.S. Dembo, \u201cDual to primal conversion in geometric programming,\u201dMathematical Programming 26 (1978) 243\u2013252.","journal-title":"Mathematical Programming"},{"key":"CR3","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dSoviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF01587098","volume":"44","author":"D.-Z. Du","year":"1989","unstructured":"D.-Z. Du and X.-S Zhang, \u201cGlobal convergence of Rosen's gradient projection method,\u201dMathematical Programming 44 (1989) 357\u2013366.","journal-title":"Mathematical Programming"},{"key":"CR5","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"R. Fletcher,Practical Methods of Optimization (Wiley, New York, 1987)."},{"key":"CR6","first-page":"1","volume-title":"Progress in Mathematical Programming: Interior Point Algorithms and Related Methods","author":"C.C. Gonzaga","year":"1989","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 Algorithms and Related Methods (Springer, New York, 1989) pp. 1\u201328."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1287\/moor.18.1.128","volume":"18","author":"O. Guler","year":"1993","unstructured":"O. Guler, \u201cExistence of interior points and interior paths in nonlinear monotone complementarity problems,\u201dMathematics of Operations Research 18 (1993) 128\u2013147.","journal-title":"Mathematics of Operations Research"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00940075","volume":"73","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, C. Roos and T. Terlaky, \u201cOn the classical logarithmic barrier function method for a class of smooth convex programming problems,\u201dJournal of Optimization Theory and Applications 73 (1992) 1\u201325.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0802005","volume":"2","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, C. Roos and T. Terlaky, \u201cA large-step analytic center method for a class of smooth convex programming problems\u201d,SIAM Journal on Optimization 2 (1992) 55\u201370.","journal-title":"SIAM Journal on Optimization"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1090\/conm\/114\/1097876","volume-title":"Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June\/July 1988, volume 114 ofContemporary Mathematics","author":"F. Jarre","year":"1990","unstructured":"F. Jarre, G. Sonnevend and J. Stoer, \u201cOn the complexity of a numerical algorithm for solving generalized convex quadratic programs by following a central path, in: J.C. Lagarias and M.J. Todd, editors,Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference held at Bowdoin College, Brunswick, Maine, USA, June\/July 1988, volume 114 ofContemporary Mathematics (American Mathematical Society, Providence, Rhode Island, USA, 1990) pp. 233\u2013242."},{"key":"CR11","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":"CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01581234","volume":"59","author":"M. Kojima","year":"1993","unstructured":"M. Kojima, N. Megiddo and S. Mizuno, \u201cTheoretical convergence of large-step primal\u2014dual interior point algorithms for linear programming,\u201dMathematical Programming 59 (1993) 1\u201321.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1287\/moor.16.4.754","volume":"16","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo and T. Noma, \u201cHomotopy continuation methods for nonlinear complementarity problems,\u201dMathematics of Operations Research 16 (1991) 754\u2013774.","journal-title":"Mathematics of Operations Research"},{"key":"CR14","volume-title":"Lecture Notes in Computer Science No. 538","author":"M. Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma and A. Yoshise, \u201cA unified approach to interior point algorithms for linear complementarity problems,\u201d in:Lecture Notes in Computer Science No. 538 (Springer, Berlin, 1991)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1287\/moor.15.4.662","volume":"15","author":"M. Kojima","year":"1990","unstructured":"M. Kojima, S. Mizuno and T. Noma, \u201cLimiting behavior of trajectories generated by a continuation method for monotone complementarity problems,\u201dMathematics of Operations Research 15 (1990) 662\u2013675.","journal-title":"Mathematics of Operations Research"},{"key":"CR16","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":"CR17","first-page":"131","volume-title":"Progress in Mathematical Programming: Interior Point Algorithms and Related Methods","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal-dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point Algorithms and Related Methods (Springer, New York, 1989) pp. 131\u2013158."},{"key":"CR18","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(\u221anL) iteration potential reduction algorithm for linear complementarity problems,\u201d Mathematical Programming 50 (1991) 331\u2013342.","journal-title":"Mathematical Programming}"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0024-3795(91)90274-Z","volume":"152","author":"K.O. Kortanek","year":"1991","unstructured":"K.O. Kortanek, F. Potra and Y. Ye, \u201cOn some efficient interior point methods for nonlinear convex programming,\u201dLinear Algebra and its Applications 152 (1991) 169\u2013189.","journal-title":"Linear Algebra and its Applications"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/moor.18.1.116","volume":"18","author":"K.O. Kortanek","year":"1993","unstructured":"K.O. Kortanek and J. Zhu, \u201cA polynomial barrier algorithm for linearly constrained convex programming problems,\u201dMathematics of Operations Research 18 (1993) 116\u2013127.","journal-title":"Mathematics of Operations Research"},{"key":"CR21","first-page":"251","volume-title":"Variational Inequalities and Complementarity Problems","author":"L. McLinden","year":"1980","unstructured":"L. McLinden, \u201cThe complementarity problem for maximal monotone multifunctions,\u201d in: R.W. Cottle, F. Giannessi and J.-L. Lions, eds.,Variational Inequalities and Complementarity Problems (Wiley, New York, 1980) pp. 251\u2013270."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point Algorithms and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point Algorithms and Related Methods (Springer, New York, 1989) pp. 131\u2013158."},{"key":"CR23","first-page":"265","volume-title":"Contemporary Mathematics: Proceedings of the AMS\u2014IMS\u2014SIAM Joint Summer Research Conference on \u201cMathematical Developments Arising from Linear Programming\u201d, held at Bowdoin College, Brunswick, Maine on July 25\u201331, 1988, vol. 114","author":"S. Mehrotra","year":"1990","unstructured":"S. Mehrotra and J. Sun, \u201cAn interior point algorithm for solving smooth convex programs based on Newton's method,\u201d in: J.C. Lagarias and M.J. Todd, ed.,Contemporary Mathematics: Proceedings of the AMS\u2014IMS\u2014SIAM Joint Summer Research Conference on \u201cMathematical Developments Arising from Linear Programming\u201d, held at Bowdoin College, Brunswick, Maine on July 25\u201331, 1988, vol. 114 (AMS, Province, RI, 1990) pp. 265\u2013284."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"945","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-dual interior-point algorithms for linear programming,\u201dMathematics of Operations Research 18 (1993) 945\u2013981.","journal-title":"Mathematics of Operations Research"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.15807\/jorsj.32.75","volume":"32","author":"S. Mizuno","year":"1989","unstructured":"S. Mizuno, A. Yoshise and T. Kikuchi, \u201cPractical polynomial time algorithms for linear complementarity problems,\u201dJournal of the Operations Research Society of Japan 32 (1989) 75\u201392.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.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":"CR27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cInterior path following primal\u2014dual algorithms. Part I: Linear programming,\u201dMathematical Programming 44 (1989) 27\u201341.","journal-title":"Mathematical Programming"},{"key":"CR28","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/moor.15.3.408","volume":"15","author":"R.D.C. Monteiro","year":"1990","unstructured":"R.D.C. Monteiro and I. Adler, \u201cAn extension of kamarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence,\u201dMathematics of Operations Research 15 (1990) 408\u2013422.","journal-title":"Mathematics of Operations Research"},{"key":"CR29","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 Mauricio 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 (1990) 191\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"CR30","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01580248","volume":"6","author":"J.J. Mor\u00e9","year":"1974","unstructured":"J.J. Mor\u00e9, \u201cClass of functions and feasibility conditions in nonlinear complementarity problem,\u201dMathematical Programming 6 (1974) 327\u2013338.","journal-title":"Mathematical Programming"},{"key":"CR31","first-page":"509","volume":"24","author":"Y.E. Nesterov","year":"1988","unstructured":"Y.E. Nesterov and A.S. Nemirovsky, \u201cA general approach to the design of optimal methods for smooth convex functions minimization,\u201dEkonomika i Matem. Metody 24 (1988) 509\u2013517. (In Russian; English transl. Matekon: Translations of Russian and East European Math. Economics.)","journal-title":"Ekonomika i Matem. Metody"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1137\/0612047","volume":"12","author":"J.S. Pang","year":"1991","unstructured":"J.S. Pang, \u201cIterative descent methods for a row sufficient linear complementarity problem,\u201dSIAM Journal on Matrix Analysis and Applications 12 (1991) 611\u2013624.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"CR33","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":"CR34","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."},{"key":"CR35","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences, No. 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,\u201d in: A. Prekopa, ed.,Lecture Notes in Control and Information Sciences, No. 84 (Springer, Berlin, 1985) pp. 866\u2013876."},{"key":"CR36","first-page":"118","volume-title":"New Methods for Linear Programming","author":"K. Tanabe","year":"1987","unstructured":"K. Tanabe, \u201cComplementarity-enforcing centered Newton method for mathematical programing: global theory,\u201d in: K. Tone, ed.,New Methods for Linear Programming (The Institute of Statistical Mathematics, Tokyo, 1987) pp. 118\u2013144."},{"key":"CR37","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BFb0042787","volume-title":"Systems Modelling and Optimization","author":"K. Tanabe","year":"1988","unstructured":"K. Tanabe, \u201cCentered Newton method for mathematical programming,\u201d in: M. Iri and K. Yajima, eds.,Systems Modelling and Optimization (Springer, New York, 1988) pp. 197\u2013206."},{"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":"265","DOI":"10.1007\/BF00941467","volume":"75","author":"P. Tseng","year":"1992","unstructured":"P. Tseng, \u201cGlobal linear convergence of a path following algorithm for some monotone variational inequality problems.\u201dJournal of Optimization Theory and Applications. 75 (1992) 265\u2013279.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR40","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)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013202.","journal-title":"Mathematical Programming"},{"key":"CR41","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 programmig,\u201dMathematical Programming 50 (1991) 239\u2013258.","journal-title":"Mathematical Programming"},{"key":"CR42","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1137\/0803043","volume":"3","author":"F.A. Potra","year":"1993","unstructured":"F.A. Potra and Y. Ye, A quadratically convergent polynomial algorithm for solving entropy optimization problems,SIAM Journal on Optimization 3 (1993) 843\u2013861.","journal-title":"SIAM Journal on Optimization"},{"key":"CR43","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01416235","volume":"36","author":"J. Zhu","year":"1992","unstructured":"J. Zhu, \u201cA path following algorithm for a class of convex programming problems,\u201dZOR \u2014 Methods and Models of Operations Research 36 (1992) 359\u2013377.","journal-title":"ZOR \u2014 Methods and Models of Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582568.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582568\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:15:51Z","timestamp":1556882151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":43,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01582568"],"URL":"https:\/\/doi.org\/10.1007\/bf01582568","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}