{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:47:36Z","timestamp":1781077656518,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,6,16]],"date-time":"2007-06-16T00:00:00Z","timestamp":1181952000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s10107-007-0141-5","type":"journal-article","created":{"date-parts":[[2007,6,16]],"date-time":"2007-06-16T13:23:02Z","timestamp":1182000182000},"page":"105-149","source":"Crossref","is-referenced-by-count":16,"title":["A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms"],"prefix":"10.1007","volume":"115","author":[{"given":"Renato D. C.","family":"Monteiro","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Takashi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,6,16]]},"reference":[{"key":"141_CR1","first-page":"54","volume":"12","author":"I.I. Dikin","year":"1974","unstructured":"Dikin I.I. (1974). On the speed of an iterative process. Upravlyaemye Sistemi 12: 54\u201360","journal-title":"Upravlyaemye Sistemi"},{"key":"141_CR2","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/S0895479895284014","volume":"17","author":"A. Forsgren","year":"1996","unstructured":"Forsgren A. (1996). On linear least-squares problems with diagonally dominant weight matrices. SIAM J. Matrix Anal. Appl. 17: 763\u2013788","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"141_CR3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"Gonzaga C.C. (1992). Path-following methods for linear programming. SIAM Rev. 34: 167\u2013224","journal-title":"SIAM Rev."},{"key":"141_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0024-3795(96)00409-0","volume":"261","author":"C.C. Gonzaga","year":"1997","unstructured":"Gonzaga C.C., Lara H.J. (1997). A note on properties of condition numbers. Linear Algebra Appl. 261: 269\u2013273","journal-title":"Linear Algebra Appl."},{"key":"141_CR5","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: Riemannian geometry underlying interior-point methods for linear programming. Mathematical Developments Arising from Linear Programming, In: Brunswick, M.E., (ed), pp. 51\u201375. Contemporary Mathematics, Vol. 114, American Mathematical Society, Providence, 1990","DOI":"10.1090\/conm\/114\/1097865"},{"key":"141_CR6","first-page":"339","volume":"82","author":"N. Megiddo","year":"1998","unstructured":"Megiddo N., Mizuno S., Tsuchiya T. (1998). A modified layered-step interior-point algorithm for linear programming. Math. Program. 82: 339\u2013355","journal-title":"Math. Program."},{"key":"141_CR7","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S. Mizuno","year":"1993","unstructured":"Mizuno S., Todd M.J., Ye Y. (1993). On adaptive-step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18: 964\u2013981","journal-title":"Math. Oper. Res."},{"issue":"1","key":"141_CR8","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/S1052623495283851","volume":"8","author":"R.D.C. Monteiro","year":"1998","unstructured":"Monteiro R.D.C., Tsuchiya T. (1998). Global convergence of the affine scaling algorithm for convex quadratic programming. SIAM J. Optim. 8(1): 26\u201358","journal-title":"SIAM J. Optim."},{"key":"141_CR9","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/S1052623401388926","volume":"13","author":"R.D.C. Monteiro","year":"2003","unstructured":"Monteiro R.D.C., Tsuchiya T. (2003). A variant of the Vavasis-Ye layered-step interior-point algorithm for linear programming. SIAM J. Optim. 13: 1054\u20131079","journal-title":"SIAM J. Optim."},{"key":"141_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1137\/S1052623402416803","volume":"15","author":"R.D.C. Monteiro","year":"2004","unstructured":"Monteiro R.D.C., Tsuchiya T. (2004). A new iteration-complexity bound for the MTY predictor-corrector algorithm. SIAM J. Optim. 15: 319\u2013347","journal-title":"SIAM J. Optim."},{"key":"141_CR11","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/BF01582904","volume":"52","author":"G. Sonnevend","year":"1991","unstructured":"Sonnevend G., Stoer J., Zhao G. (1991). On the complexity of following the central path of linear programs by linear extrapolation. II. Math. Program. 52: 527\u2013553","journal-title":"Math. Program."},{"key":"141_CR12","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0024-3795(89)90594-6","volume":"112","author":"G.W. Stewart","year":"1989","unstructured":"Stewart G.W. (1989). On scaled projections and pseudoinverses. Linear Algebra Appl. 112: 189\u2013193","journal-title":"Linear Algebra Appl."},{"key":"141_CR13","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1287\/opre.38.6.1006","volume":"38","author":"M.J. Todd","year":"1990","unstructured":"Todd M.J. (1990). A Dantzig-Wolfe-like variant of Karmarkar\u2019s interior-point linear programming algorithm. Oper. Res. 38: 1006\u20131018","journal-title":"Oper. Res."},{"issue":"1","key":"141_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/PL00011420","volume":"90","author":"M.J. Todd","year":"2001","unstructured":"Todd M.J., Tun\u00e7el L., Ye Y. (2001). Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems. Math. Program. 90(1): 59\u201370","journal-title":"Math. Program."},{"key":"141_CR15","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.17.3.527","volume":"17","author":"T. Tsuchiya","year":"1992","unstructured":"Tsuchiya T. (1992). Global convergence property of the affine scaling method for primal degenerate linear programming problems. Math. Oper. Res. 17: 527\u2013557","journal-title":"Math. Oper. Res."},{"issue":"1","key":"141_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/s101070050087","volume":"86","author":"L. Tun\u00e7el","year":"1999","unstructured":"Tun\u00e7el L. (1999). Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard. Math. Program. 86(1): 219\u2013223","journal-title":"Math. Program."},{"issue":"4","key":"141_CR17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0167-6377(98)00051-0","volume":"24","author":"L. Tun\u00e7el","year":"1999","unstructured":"Tun\u00e7el L. (1999). On the condition numbers for polyhedra in Karmarkar\u2019s form. Oper. Res. Lett. 24(4): 149\u2013155","journal-title":"Oper. Res. Lett."},{"key":"141_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/conm\/114\/1097868","volume":"114","author":"R.J. Vanderbei","year":"1990","unstructured":"Vanderbei R.J., Lagarias J.C. (1990). I. I. Dikin\u2019s convergence result for the affine-scaling algorithm, Vol 17. Contemp. Math. 114: 109\u2013119","journal-title":"Contemp. Math."},{"key":"141_CR19","first-page":"79","volume":"74","author":"S. Vavasis","year":"1996","unstructured":"Vavasis S., Ye Y. (1996). A primal-dual accelerated interior point method whose running time depends only on A. Math. Program. 74: 79\u2013120","journal-title":"Math. Program."},{"key":"141_CR20","unstructured":"Vavasis, S., Ye, Y.: On the relationship between layered least squares and affine scaling steps. In: The Mathematics of Numerical Analysis, pp. 857\u2013865. Lectures in Applied Mathematics, Vol. 32. American Mathematical Society, Providence, 1996"},{"key":"141_CR21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/0806005","volume":"6","author":"G. Zhao","year":"1996","unstructured":"Zhao G. (1996). On the relationship between the curvature integral and the complexity of path-following methods in linear programming. SIAM J. Optim. 6: 57\u201373","journal-title":"SIAM J. Optim."},{"key":"141_CR22","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/BF01182599","volume":"27","author":"G. Zhao","year":"1993","unstructured":"Zhao G., Stoer J. (1993). Estimating the complexity of a class of path-following methods for solving linear programs by curvature integrals. Appl. Math. Optim. 27: 85\u2013103","journal-title":"Appl. Math. Optim."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0141-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0141-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0141-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:04Z","timestamp":1559123404000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0141-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,16]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["141"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0141-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,16]]}}}