{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T06:34:59Z","timestamp":1649054099217},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,12,12]],"date-time":"2006-12-12T00:00:00Z","timestamp":1165881600000},"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":[[2007,6,20]]},"DOI":"10.1007\/s10107-006-0067-3","type":"journal-article","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T20:04:37Z","timestamp":1165867477000},"page":"301-313","source":"Crossref","is-referenced-by-count":1,"title":["Dual versus primal-dual interior-point methods for linear and conic programming"],"prefix":"10.1007","volume":"111","author":[{"given":"M. J.","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,12,12]]},"reference":[{"issue":"3","key":"67_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"Adler I., Resende M.G.C., Veiga G. and Karmarkar N.K. (1989). An implementation of Karmarkar\u2019s algorithm for linear programming. Math. Program. 44(3): 297\u2013335","journal-title":"Math. Program."},{"issue":"2","key":"67_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1137\/S1052623497328008","volume":"10","author":"S.J. Benson","year":"2000","unstructured":"Benson S.J., Ye Y. and Zhang X. (2000). Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM J. Optim. 10(2): 443\u2013461","journal-title":"SIAM J. Optim."},{"key":"67_CR3","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"Gay D.M. (1985). Electronic mail distribution of linear programming test problems. Math. Program. Soc. Comm. Algorithm. Newslett. 13: 10\u201312","journal-title":"Math. Program. Soc. Comm. Algorithm. Newslett."},{"issue":"2","key":"67_CR4","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(2): 167\u2013224","journal-title":"SIAM Rev."},{"key":"67_CR5","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1137\/0802017","volume":"2","author":"C.C. Gonzaga","year":"1992","unstructured":"Gonzaga C.C. and Todd M.J. (1992). SIAM J. Optim. 2: 349\u2013359","journal-title":"SIAM J. Optim."},{"key":"67_CR6","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/moor.21.4.860","volume":"21","author":"O. G\u00fcler","year":"1996","unstructured":"G\u00fcler O. (1996). Barrier functions in interior point methods. Math. Oper. Res. 21: 860\u2013885","journal-title":"Math. Oper. Res."},{"key":"67_CR7","volume-title":"Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms","author":"Y.E. Nesterov","year":"1993","unstructured":"Nesterov Y.E. and Nemirovskii A.S. (1993). Interior Point Polynomial Methods in Convex Programming: Theory and Algorithms. SIAM, Philadelphia"},{"key":"67_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"Renegar J. (1988). A polynomial-time algorithm based on Newton\u2019s method for linear programming. Math. Program. 40: 59\u201393","journal-title":"Math. Program."},{"key":"67_CR9","volume-title":"Theory and Algorithms for Linear Optimization: An Interior Point Approach","author":"C. Roos","year":"1997","unstructured":"Roos C., Terlaky T. and Vial J.P. (1997). Theory and Algorithms for Linear Optimization: An Interior Point Approach. Wiley, Chichester"},{"key":"67_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1017\/CBO9781139106962.008","volume-title":"Foundations of Computational Mathematics, Minneapolis 2002","author":"M.J. Todd","year":"2004","unstructured":"Todd M.J. (2004). Detecting infeasibility in infeasible-interior-point methods for optimization. In: Cucker, F., DeVore, R., Olver, P. and S\u00fcli, E. (eds) Foundations of Computational Mathematics, Minneapolis 2002, pp 157\u2013192. Cambridge University Press, Cambridge"},{"issue":"2","key":"67_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-002-0347-5","volume":"95","author":"R.H. T\u00fct\u00fcnc\u00fc","year":"2003","unstructured":"T\u00fct\u00fcnc\u00fc R.H., Toh K.C. and Todd M.J. (2003). Solving semidefinite-quadratic-linear programs using SDPT3. Math. Program. 95(2): 189\u2013217","journal-title":"Math. Program."},{"key":"67_CR12","volume-title":"Primal-Dual Interior Point Methods","author":"S. Wright","year":"1996","unstructured":"Wright S. (1996). Primal-Dual Interior Point Methods. SIAM, Philadelphia"},{"key":"67_CR13","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Ye Y. (1997). Interior Point Algorithms: Theory and Analysis. Wiley, New York"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0067-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-006-0067-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0067-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:02Z","timestamp":1559123402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-006-0067-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,12]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2007,6,20]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0067-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,12]]}}}