{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:33:34Z","timestamp":1752460414395},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1007\/bf01299206","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T04:33:38Z","timestamp":1111725218000},"page":"305-315","source":"Crossref","is-referenced-by-count":5,"title":["Scaling, shifting and weighting in interior-point methods"],"prefix":"10.1007","volume":"3","author":[{"given":"Michael J.","family":"Todd","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/114\/1097874","volume-title":"Mathematical Developments Arising from Linear Programming, volume 114 ofContemporary Mathematics","author":"I. Adler","year":"1990","unstructured":"Adler, I. and Monteiro, R.D.C., ?Limiting behavior of the affine scaling continous trajectories for linear programming problems,? in: J. C. Lagarias and M. J. Todd, editors.Mathematical Developments Arising from Linear Programming, volume 114 ofContemporary Mathematics, pp. 189?211, American Mathematical Society, Providence, RI, 1990."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"Barnes, E.R., ?A variation of Karmarkar's algorithm for solving linear programming problems,?Mathematical Programming, 36: 174?182, 1986.","journal-title":"Mathematical Programming"},{"issue":"2","key":"CR3","first-page":"527","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"Bayer, D.A. and Lagarias, J.C., ?The nonlinear geometry of linear programming, Part II: Legendre transform coordinates,?Transactions of the American Mathematical Society, 314(2): 527?581, 1989.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR4","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B.,Linear Programming and Extensions, Princeton University Press, Princeton, NJ, 1963."},{"key":"CR5","first-page":"747","volume":"174","author":"I.I. Dikin","year":"1967","unstructured":"Dikin, I.I., ?Iterative solution of problems of linear and quadratic programming,?Doklady Akademii Nauk SSSR, 174: 747?748, 1967 (translated in:Soviet Mathematics Doklady, 8: 674?675, 1967).","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"CR6","first-page":"54","volume":"12","author":"I.I. Dikin","year":"1974","unstructured":"Dikin, I.I., ?On the convergence of an iterative process,?Upravlyaemye Sistemi, 12: 54?60, 1974 (in Russian).","journal-title":"Upravlyaemye Sistemi"},{"key":"CR7","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.,Practical Methods of Optimization, Wiley, Chichester-New York, 1987."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0024-3795(91)90265-X","volume":"152","author":"R.M. Freund","year":"1991","unstructured":"Freund, R.M., ?Theoretical efficiency of a shifted barrier function algorithm for linear programming,?Linear Algebra and Its Applications, 152: 19?41, 1991.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01581277","volume":"58","author":"R.M. Freund","year":"1993","unstructured":"Freund, R.M., ?Projective transformations for interior point algorithms, a superlinearly convergent algorithm for the w-center problem,?Mathematical Programming, 58 (1993), 385?414.","journal-title":"Mathematical Programming"},{"key":"CR10","series-title":"Technical Report","volume-title":"Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables","author":"R.M. Freund","year":"1992","unstructured":"Freund, R.M. and Todd, M.J., ?Barrier functions and interior-point algorithms for linear programming with zero-, one-, or two-sided bounds on the variables,? Technical Report 1016, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853-3801, USA, July 1992, to appear inMathematics of Operations Research."},{"issue":"2","key":"CR11","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"Gonzaga, C.C., ?Path following methods for linear programming,?SIAM Review, 34(2): 167?227, 1992.","journal-title":"SIAM Review"},{"key":"CR12","series-title":"Technical Report SOL 88-9","volume-title":"Shifted barrier methods for linear programming","author":"P.E. Gill","year":"1988","unstructured":"Gill, P.E., Murray, W., Saunders, M.A. and Wright, M.H., ?Shifted barrier methods for linear programming,? Technical Report SOL 88-9, Systems Optimization Laboratory, Dept. of Operations Research, Stanford University, Stanford, CA 94305, USA, August 1988."},{"key":"CR13","series-title":"IBM Research Report RC 18570","volume-title":"The convergence of a modified barrier method for convex programming","author":"D.L. Jensen","year":"1992","unstructured":"Jensen, D.L. and Polyak, R., ?The convergence of a modified barrier method for convex programming,? IBM Research Report RC 18570 (# 81288), T.J. Watson Research Center, Yorktown Heights, NY 10598, USA, November 1992, revised March 1994."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"Karmarkar, N.K., ?A new polynomial-time algorithm for linear programming,?Combinatorica, 4: 373?395, 1984.","journal-title":"Combinatorica"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/conm\/114\/1097865","volume-title":"Mathematical Developments Arising from Linear Programming, volume 114of Contemporary Mathematics","author":"N.K. Karmarkar","year":"1990","unstructured":"Karmarkar, N.K., ?Riemannian geometry underlying interior-point methods for linear programming,? in: J.C. Lagarias and M.J. Todd, editors,Mathematical Developments Arising from Linear Programming, volume 114of Contemporary Mathematics, pp. 51?75, American Mathematical Society, Providence, RI, 1990."},{"key":"CR16","first-page":"11","volume":"1","author":"E. Kranich","year":"1992","unstructured":"Kranich, E., ?Interior-point methods bibliography,?SIAG\/OPT Views-and-News, A Forum for the SIAM Activity Group on Optimization, 1: 11, 1992.","journal-title":"SIAG\/OPT Views-and-News, A Forum for the SIAM Activity Group on Optimization"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"Lustig, I.J., Marsten, R.E., and Shanno, D.F., ?On implementing Mehrotra's predictor-corrector interior point method for linear programming,?SIAM Journal on Optimization, 2: 435?449, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"N. Megiddo","year":"1989","unstructured":"Megiddo, N., ?Pathways to the optimal set in linear programming?, in: N. Megiddo, editor,Progress in Mathematical Programming: Interior Point and Related Methods, pp. 131?158, Springer Verlag, New York, 1989."},{"issue":"4","key":"CR19","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra, S., ?On the implementation of a primal-dual interior point method?,SIAM Journal on Optimization, 2(4): 575?601, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"CR20","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":"Nesterov, Y.E. and Nemirovsky, A.S.,Interior Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, USA, 1994."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R. Polyak","year":"1992","unstructured":"Polyak, R., ?Modified barrier functions (theory and methods),?Mathematical Programming, 54: 177?222, 1992.","journal-title":"Mathematical Programming"},{"key":"CR22","series-title":"Technical Report DAMTP 1992\/NA7","volume-title":"Some convergence properties of the modified log barrier method for linear programming","author":"M.J.D. Powell","year":"1992","unstructured":"Powell, M.J.D., ?Some convergence properties of the modified log barrier method for linear programming,? Technical Report DAMTP 1992\/NA7, Dept. of Applied Mathematics and Theoretical Physics, University of Cambridge, Silver Street, Cambridge CB 3 9EW, UK, November 1992, revised January 1994."},{"key":"CR23","first-page":"109","volume-title":"Mathematical Programming: Recent Developments and Applications","author":"M.J. Todd","year":"1989","unstructured":"Todd, M.J., ?Recent developments and new directions in linear programming,? in: M. Iri and K. Tanabe, editors,Mathematical Programming: Recent Developments and Applications, pp. 109?157, Kluwer Academic Press, Dordrecht, The Netherlands, 1989."},{"key":"CR24","doi-asserted-by":"crossref","unstructured":"Todd, M.J., ?Analysis of interior-point methods for linear programming problems with variable upper bounds,? Susana Gomez and Jean-Pierre Hennart, editors,Advances in Optimization and Numerical Analysis, Mathematics and its Applications 275, Kluwer Academic Publishers, 1994.","DOI":"10.1007\/978-94-015-8330-5_1"},{"key":"CR25","unstructured":"Tuncel, L., private communication."},{"issue":"4","key":"CR26","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"Vanderbei, R.J., Meketon, M.S., and Freedman, B.A., ?A modification of Karmarkar's linear programming algorithm,?Algorithmica, 1(4): 395?407, 1986.","journal-title":"Algorithmica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299206.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01299206\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01299206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:50:00Z","timestamp":1586181000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01299206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["BF01299206"],"URL":"https:\/\/doi.org\/10.1007\/bf01299206","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}