{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,25]],"date-time":"2022-08-25T14:11:40Z","timestamp":1661436700675},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,11]]},"DOI":"10.1007\/bf01769704","type":"journal-article","created":{"date-parts":[[2005,6,17]],"date-time":"2005-06-17T15:56:48Z","timestamp":1119023808000},"page":"365-382","source":"Crossref","is-referenced-by-count":16,"title":["A Long-step barrier method for convex quadratic programming"],"prefix":"10.1007","volume":"10","author":[{"given":"K. M.","family":"Anstreicher","sequence":"first","affiliation":[]},{"given":"D. den","family":"Hertog","sequence":"additional","affiliation":[]},{"given":"C.","family":"Roos","sequence":"additional","affiliation":[]},{"given":"T.","family":"Terlaky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01769704_CR1","volume-title":"Polynomial Barrier Function Algorithms for Convex Quadratic Programming, Research Report No. J88-5, School of Industrial and Systems Engineering","author":"M. Ben Daya","year":"1988","unstructured":"Ben Daya, M., and Shetty, C. M. (1988), Polynomial Barrier Function Algorithms for Convex Quadratic Programming, Research Report No. J88-5, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA."},{"key":"BF01769704_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0802005","volume":"2","author":"D. Den Hertog","year":"1992","unstructured":"Den Hertog, D., Roos, C., and Terlaky, T. (1992), A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems,SIAM Journal on Optimization,2, 55\u201370.","journal-title":"SIAM Journal on Optimization"},{"key":"BF01769704_CR3","first-page":"1","volume":"73","author":"D. Den Hertog","year":"1992","unstructured":"Den Hertog, D., Roos, C. and Terlaky, T. (1992), On the Classical Logarithmic Barrier Method for a Class of Smooth Convex Programming Problems,Journal on Optimization: Theory and Applications,73, 1\u201325.","journal-title":"Journal on Optimization: Theory and Applications"},{"key":"BF01769704_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1137\/0802006","volume":"2","author":"D. Den Hertog","year":"1992","unstructured":"Den Hertog, D., Roos, C., and Vial, J.-Ph. (1992), A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming,SIAM Journal on Optimization,2, 71\u201387.","journal-title":"SIAM Journal on Optimization"},{"key":"BF01769704_CR5","first-page":"747","volume":"174","author":"I. I. Dikin","year":"1967","unstructured":"Dikin, I. I. (1967), Iterative Solution of Problems of Linear and Quadratic Programming,Doklady Akademiia Nauk SSSR,174, 747\u2013748.","journal-title":"Doklady Akademiia Nauk SSSR"},{"key":"BF01769704_CR6","volume-title":"Nonlinear Programming, Sequential Unconstrained Minimization Techniques","author":"A. V. Fiacco","year":"1968","unstructured":"Fiacco, A. V., and McCormick, G. P. (1968),Nonlinear Programming, Sequential Unconstrained Minimization Techniques, Wiley, New York."},{"key":"BF01769704_CR7","volume-title":"Practical Optimization","author":"P. E. Gill","year":"1988","unstructured":"Gill, P. E., Murray, W., and Wright, M. H. (1988),Practical Optimization, Academic Press, San Diego, CA."},{"key":"BF01769704_CR8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D. Goldfarb","year":"1990","unstructured":"Goldfarb, D., and Liu, S. (1990), An O(n3L) Primal Interior Point Algorithm for Convex Quadratic Programming,Mathematical Programming,49, 325\u2013340.","journal-title":"Mathematical Programming"},{"key":"BF01769704_CR9","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0801018","volume":"1","author":"C. C. Gonzaga","year":"1991","unstructured":"Gonzaga, C. C. (1991), Large-Step Path-Following Methods for Linear Programming: Barrier Function Method,SIAM Journal on Optimization,1, 268\u2013279.","journal-title":"SIAM Journal on Optimization"},{"key":"BF01769704_CR10","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01588796","volume":"49","author":"F. Jarre","year":"1990\/91","unstructured":"Jarre, F. (1990\/91), On the Convergence of the Method of Analytic Centers when Applied to Convex Quadratic Programs,Mathematical Programming,49, 341\u2013358.","journal-title":"Mathematical Programming"},{"key":"BF01769704_CR11","volume-title":"The Method of Analytic Centers for Smooth Convex Programs, Dissertation, Institut f\u00fcr Angewandte Mathematik und Statistik","author":"F. Jarre","year":"1989","unstructured":"Jarre, F. (1989), The Method of Analytic Centers for Smooth Convex Programs, Dissertation, Institut f\u00fcr Angewandte Mathematik und Statistik, Universit\u00e4t W\u00fcrzburg, W\u00fcrzburg."},{"key":"BF01769704_CR12","doi-asserted-by":"crossref","unstructured":"Kapoor, S., and Vaidya, P. (1986), Fast Algorithms for Convex Quadratic Programming and Multicommodity Flows,Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, pp. 147\u2013159.","DOI":"10.1145\/12130.12145"},{"key":"BF01769704_CR13","volume-title":"An Extension of Karmarkar's Interior Point Method to Convex Quadratic Programming, Technical Report, Department of Computer Science","author":"S. Kapoor","year":"1988","unstructured":"Kapoor, S., and Vaidya, P. M. (1988), An Extension of Karmarkar's Interior Point Method to Convex Quadratic Programming, Technical Report, Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL."},{"key":"BF01769704_CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"Karmarkar, N. (1984), A New Polynomial-Time Algorithm for Linear Programming,Combinatorica,4, 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF01769704_CR15","volume-title":"Lecture Notes in Computer Science, Vol. 538","author":"M. Kojima","year":"1991","unstructured":"Kojima, M., Megiddo, N., Noma, T., and Yoshise, A. (1991),A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, Vol. 538, Springer-Verlag, Berlin."},{"key":"BF01769704_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M. Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., and Yoshise, A. (1989), A Polynomial Time Algorithm for a Class of Linear Complementarity Problems,Mathematical Programming,44, 1\u201326.","journal-title":"Mathematical Programming"},{"key":"BF01769704_CR17","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01594942","volume":"50","author":"M. Kojima","year":"1991","unstructured":"Kojima, M., Mizuno, S., and Yoshise, A. (1991), An 0(\u221anL) Iteration Potential Reduction Algorithm for Linear Complementarity Problems,Mathematical Programming,50, 331\u2013342.","journal-title":"Mathematical Programming"},{"key":"BF01769704_CR18","first-page":"265","volume-title":"An Interior Point Algorithm for Solving Smooth Convex Programs Based on Newton's Method, Contemporary Mathematics, Vol. 114","author":"S. Mehrotra","year":"1990","unstructured":"Mehrotra, S., and Sun, J. (1990),An Interior Point Algorithm for Solving Smooth Convex Programs Based on Newton's Method, Contemporary Mathematics, Vol. 114. American Mathematical Society, Providence, RI, pp. 265\u2013284."},{"key":"BF01769704_CR19","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01594926","volume":"50","author":"S. Mehrotra","year":"1991","unstructured":"Mehrotra, S., and Sun, J. (1991), On Computing the Center of a Quadratically Constrained Set,Mathematical Programming,50, 81\u201389.","journal-title":"Mathematical Programming"},{"key":"BF01769704_CR20","doi-asserted-by":"crossref","first-page":"66","DOI":"10.15807\/jorsj.33.66","volume":"33","author":"S. Mizuno","year":"1990","unstructured":"Mizuno, S. (1990), AnO(n 3 L) Algorithm Using a Sequence for a Linear Complementarity Problem,Journal of the Operations Research Society of Japan,33, 66\u201375.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"BF01769704_CR21","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"R. D. C. Monteiro","year":"1989","unstructured":"Monteiro, R. D. C., and Adler, I. (1989), Interior Path-Following Primal-Dual Algorithms, Part II: Convex Quadratic Programming,Mathematical Programming,44, 43\u201366.","journal-title":"Mathematical Programming"},{"key":"BF01769704_CR22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R. D. C. Monteiro","year":"1990","unstructured":"Monteiro, R. D. C., Adler, I. and Resende, M. G. C. (1990), A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension,Mathematics of Operations Research,15, 191\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"BF01769704_CR23","volume-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"K. G. Murty","year":"1988","unstructured":"Murty, K. G. (1988),Linear Complementarity, Linear and Nonlinear Programming, Heldermann-Verlag, Berlin."},{"key":"BF01769704_CR24","volume-title":"Self-Concordant Functions and Polynomial Time Methods in Convex Programming, Book Preprint, CEMI","author":"Y. E. Nesterov","year":"1989","unstructured":"Nesterov, Y. E., and Nemirovsky, A. S. (1989), Self-Concordant Functions and Polynomial Time Methods in Convex Programming, Book Preprint, CEMI, USSR Academy of Sciences, Moscow."},{"key":"BF01769704_CR25","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. R. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. R., and Steiglitz, K. (1982),Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ."},{"key":"BF01769704_CR26","volume-title":"Simplified Complexity Analysis for Newton LP Methods, Technical Report No. 807, School of Operations Research and Industrial Engineering","author":"J. Renegar","year":"1988","unstructured":"Renegar, J., and Shub, M. (1988) Simplified Complexity Analysis for Newton LP Methods, Technical Report No. 807, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY."},{"key":"BF01769704_CR27","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01586056","volume":"54","author":"C. Roos","year":"1992","unstructured":"Roos, C., and Vial, J.-Ph. (1992), A Polynomial Method of Approximate Centers for Linear Programming,Mathematical Programming,54, 295\u2013305.","journal-title":"Mathematical Programming"},{"key":"BF01769704_CR28","volume-title":"Further Development on the Interior Algorithm for Convex Quadratic Programming","author":"Y. Ye","year":"1987","unstructured":"Ye, Y. (1987), Further Development on the Interior Algorithm for Convex Quadratic Programming, Engineering-Economic Systems Department, Stanford University, Stanford, CA."},{"key":"BF01769704_CR29","volume-title":"Interior Algorithms for Linear, Quandratic and Linearly Constrained Convex Programming, Ph.D. Dissertation, Engineering-Economic Systems Department","author":"Y. Ye","year":"1987","unstructured":"Ye, Y. (1987), Interior Algorithms for Linear, Quandratic and Linearly Constrained Convex Programming, Ph.D. Dissertation, Engineering-Economic Systems Department, Stanford University, Stanford, CA."},{"key":"BF01769704_CR30","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0024-3795(91)90264-W","volume":"152","author":"Y. Ye","year":"1991","unstructured":"Ye, Y., and Pardalos, P. (1991), A Class of Linear Complementarity Problems Solvable in Polynomial Time,Linear Algebra and Its Applications,152, 3\u201317.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF01769704_CR31","volume-title":"A Polynomial-Time Algorithm for Convex Quadratic Programming, Engineering-Economic Systems Department","author":"Y. Ye","year":"1986","unstructured":"Ye, Y., and Tse, E. (1986), A Polynomial-Time Algorithm for Convex Quadratic Programming, Engineering-Economic Systems Department, Stanford University, Stanford, CA."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01769704.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01769704\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01769704","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T17:13:01Z","timestamp":1557335581000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01769704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["BF01769704"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf01769704","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":["Applied Mathematics","Computer Science Applications","General Computer Science"],"published":{"date-parts":[[1993,11]]}}}