{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T19:41:40Z","timestamp":1771530100687,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1023\/a:1008637929927","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"5-19","source":"Crossref","is-referenced-by-count":7,"title":["On the Interplay among Entropy, Variable Metrics and Potential Functions in Interior-Point Algorithms"],"prefix":"10.1007","volume":"8","author":[{"given":"Levent","family":"Tuncel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael J.","family":"Todd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"131338_CR1","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, \"The nonlinear geometry of linear programming: I. Affine and projective scaling trajectories, II. Legendre transform coordinates and central trajectories,\" Transactions of the American Mathematical Society, vol. 314, pp. 499\u2013581, 1989.","journal-title":"Transactions of the American Mathematical Society"},{"key":"131338_CR2","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \"Iterative solution of problems of linear and quadratic programming,\" Soviet Mathematics Doklady, vol. 8, pp. 674\u2013675, 1967.","journal-title":"Soviet Mathematics Doklady"},{"key":"131338_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01584236","volume":"21","author":"S. Erlander","year":"1981","unstructured":"S. Erlander, \"Entropy in linear programs,\" Mathematical Programming, vol. 21, pp. 137\u2013151, 1981.","journal-title":"Mathematical Programming"},{"key":"131338_CR4","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1137\/0805014","volume":"5","author":"R.M. Freund","year":"1995","unstructured":"R.M. Freund, \"A potential reduction algorithm with user-specified phase I-phase II balance for solving linear program from an infeasible warm start,\" SIAM Journal on Optimization, vol. 5, pp. 247\u2013268, 1995.","journal-title":"SIAM Journal on Optimization"},{"key":"131338_CR5","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.20.2.415","volume":"20","author":"R.M. Freund","year":"1995","unstructured":"R.M. Freund and M.J. Todd, \"Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables,\" Mathematics of Operations Research, vol. 20, pp. 415\u2013440, 1995.","journal-title":"Mathematics of Operations Research"},{"key":"131338_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, \"Path following methods for linear programming,\" SIAM Review, vol. 34, pp. 167\u2013227, 1992.","journal-title":"SIAM Review"},{"key":"131338_CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/moor.21.2.341","volume":"21","author":"B. Jansen","year":"1996","unstructured":"B. Jansen, C. Roos, and T. Terlaky, \"A polynomial primal-dual Dikin-type algorithm for linear programming,\" Mathematics of Operations Research, vol. 21, pp. 341\u2013353, 1996.","journal-title":"Mathematics of Operations Research"},{"key":"131338_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \"A new polynomial time algorithm for linear programming,\" Combinatorica, vol. 4, pp. 373\u2013395, 1984.","journal-title":"Combinatorica"},{"key":"131338_CR9","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, \"Theoretical convergence of large-step primal-dual interior point algorithms for linear programming,\" Mathematical Programming, vol. 59, pp. 1\u201321, 1993.","journal-title":"Mathematical Programming"},{"key":"131338_CR10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S. Mizuno","year":"1994","unstructured":"S. Mizuno, \"Polynomiality of infeasible-interior-point algorithms for linear programming,\" Mathematical Programming, vol. 67, pp. 109\u2013119, 1994.","journal-title":"Mathematical Programming"},{"key":"131338_CR11","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, \"On adaptive-step primal-dual interior-point algorithms for linear programming,\" Mathematics of Operations Research, vol. 18, pp. 964\u2013981, 1993.","journal-title":"Mathematics of Operations Research"},{"key":"131338_CR12","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 M.G.C. Resende, \"A polynomial time primal-dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,\" Mathematics of Operations Research, vol. 15, pp. 191\u2013214, 1990.","journal-title":"Mathematics of Operations Research"},{"key":"131338_CR13","volume-title":"A reformulation of the central path equations and its algorithmic implications","author":"J.L. Nazareth","year":"1994","unstructured":"J.L. Nazareth, \"A reformulation of the central path equations and its algorithmic implications,\" Technical Report 94-1, Department of Pure and Applied Mathematics, Washington State University, Pullman, WA, 1994."},{"key":"131338_CR14","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y.E. Nesterov","year":"1994","unstructured":"Y.E. Nesterov and A.S. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Publications, SIAM, Philadelphia, 1994."},{"key":"131338_CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R. Polyak","year":"1992","unstructured":"R. Polyak, \"Modified barrier functions (theory and methods),\" Mathematical Programming, vol. 54, pp. 177\u2013222, 1992.","journal-title":"Mathematical Programming"},{"key":"131338_CR16","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BF01582228","volume":"67","author":"F.A. Potra","year":"1994","unstructured":"F.A. Potra, \"A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points,\" Mathematical Programming, vol. 67, pp. 383\u2013406, 1994.","journal-title":"Mathematical Programming"},{"key":"131338_CR17","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF01299206","volume":"3","author":"M.J. Todd","year":"1994","unstructured":"M.J. Todd, \"Scaling, shifting and weighting in interior-point methods,\" Computational Optimization and Applications, vol. 3, pp. 305\u2013315, 1994.","journal-title":"Computational Optimization and Applications"},{"key":"131338_CR18","first-page":"3","volume":"76","author":"M.J. Todd","year":"1997","unstructured":"M.J. Todd, \"Potential reduction methods in mathematical programming,\" Mathematical Programming, Series B, vol. 76, pp. 3\u201345, 1997.","journal-title":"Mathematical Programming"},{"key":"131338_CR19","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y. Zhang","year":"1994","unstructured":"Y. Zhang, \"On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem,\" SIAM Journal on Optimization, vol. 4, pp. 208\u2013227, 1994.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008637929927.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008637929927\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008637929927.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:03:51Z","timestamp":1752375831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008637929927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["131338"],"URL":"https:\/\/doi.org\/10.1023\/a:1008637929927","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}