{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:42:02Z","timestamp":1648752122880},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1007\/bf01581079","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:52:15Z","timestamp":1114667535000},"page":"163-192","source":"Crossref","is-referenced-by-count":17,"title":["A scaling technique for finding the weighted analytic center of a polytope"],"prefix":"10.1007","volume":"57","author":[{"given":"David S.","family":"Atkinson","sequence":"first","affiliation":[]},{"given":"Pravin M.","family":"Vaidya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"J. Edmonds and R.M. Karp, \u201cTheoretical improvements in algorithmic efficiency for network flow problems,\u201dJournal of the ACM 19 (1972) 248\u2013264.","journal-title":"Journal of the ACM"},{"key":"CR2","series-title":"Working Paper","volume-title":"Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem","author":"R. Freund","year":"1989","unstructured":"R. Freund, \u201cProjective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problem,\u201d Working Paper, Alfred P. Sloan School of Management, MIT (Cambridge, MA, 1989)."},{"key":"CR3","unstructured":"R. Freund and K. Tan, \u201cA method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming,\u201d to appear in:Mathematics of Operations Research."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"H.N. Gabow","year":"1985","unstructured":"H.N. Gabow, \u201cScaling algorithms for network problems,\u201dJournal of Computer and System Sciences 31 (1985) 148\u2013168.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR5","first-page":"1","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"C. Gonzaga","year":"1989","unstructured":"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 and Related Methods (Springer, Berlin, 1989) pp. 1\u201328."},{"key":"CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"CR7","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":"CR8","volume-title":"Self-concordant functions and polynomial time methods in convex programming","author":"Y. Nesterov","year":"1989","unstructured":"Y. Nesterov and A. Nemirovsky, \u201cSelf-concordant functions and polynomial time methods in convex programming,\u201d manuscript, USSR Academy of Sciences (Moscow, 1989)."},{"key":"CR9","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":"CR10","volume-title":"An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming","author":"G. Sonnevend","year":"1989","unstructured":"G. Sonnevend, \u201cAn analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201d preprint, Department of Numerical Analysis, Institute of Mathematics, E\u00f6tv\u00f6s University (Budapest, 1989)."},{"key":"CR11","volume-title":"\u201cNewton's method for the general parametric center problem with applications,\u201d Technical Report No. 457","author":"K. Tan","year":"1991","unstructured":"K. Tan and R. Freund, \u201cNewton's method for the general parametric center problem with applications,\u201d Technical Report No. 457, Department of Mathematics, National University of Singapore (Singapore, 1991)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P. Vaidya","year":"1990","unstructured":"P. Vaidya, \u201cAn algorithm for linear programming which requires O(((m+n)n 2+(m+n) 1.5 n)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013201.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/SFCS.1989.63500","volume-title":"Proceedings of 30th Annual IEEE Symposium on Foundations of Computer Science","author":"P. Vaidya","year":"1989","unstructured":"P. Vaidya, \u201cA new algorithm for minimizing convex functions over convex sets,\u201d in:Proceedings of 30th Annual IEEE Symposium on Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 1989) pp. 338\u2013343, to appear in:Mathematical Programming."},{"key":"CR14","first-page":"81","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"P. Vaidya","year":"1989","unstructured":"P. Vaidya, \u201cA locally well-behaved potential function and a simple Newton-type method for finding the center of a polytope,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point and Related Methods (Springer, Berlin, 1989) pp. 81\u201390."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581079.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581079\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:12:14Z","timestamp":1556881934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["BF01581079"],"URL":"https:\/\/doi.org\/10.1007\/bf01581079","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}