{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:42:16Z","timestamp":1787503336531,"version":"build-2736575974"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T00:00:00Z","timestamp":1194652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2007,11,15]]},"DOI":"10.1007\/s11075-007-9135-x","type":"journal-article","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T04:09:17Z","timestamp":1194581357000},"page":"173-188","source":"Crossref","is-referenced-by-count":12,"title":["An infeasible interior-point algorithm with full-Newton step for linear optimization"],"prefix":"10.1007","volume":"46","author":[{"given":"Zhongyi","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyu","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,11,10]]},"reference":[{"issue":"1","key":"9135_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1590\/S0101-82052006000100005","volume":"25","author":"M. Achache","year":"2006","unstructured":"Achache, M.: A new primal-dual path-following method for convex quadratic programming. Comput. Appl. Math. 25(1), 97\u2013110 (2006)","journal-title":"Comput. Appl. Math."},{"issue":"3","key":"9135_CR2","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1080\/10556780600816692","volume":"22","author":"H. Mansouri","year":"2007","unstructured":"Mansouri, H., Roos, C.: Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton step. Optim. Methods Softw. 22(3), 519\u2013530 (2007)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"9135_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01582216","volume":"67","author":"S. Mizuno","year":"1994","unstructured":"Mizuno, S.: Polynomiality of infeasible-interior-point algorithms for linear programming. Math. Program. 67(1), 109-119 (1994)","journal-title":"Math. Program."},{"issue":"1","key":"9135_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1023\/A:1019280614748","volume":"99","author":"J. Peng","year":"2000","unstructured":"Peng, J., Roos, C., Terlaky, T.: New complexity analysis of the primal-dual Newton method for linear optimization. Ann. Oper. Res. 99(1), 23\u201339 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9135_CR5","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/S0377-2217(02)00275-8","volume":"143","author":"J. Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: A new class of polynomial primal-dual methods for linear and semidefinite optimization. Eur. J. Oper. Res. 143(2), 234\u2013256 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9135_CR6","volume-title":"Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms","author":"J. Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms. Princeton University Press, Princeton (2002)"},{"issue":"1","key":"9135_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0806002","volume":"6","author":"F.A. Potra","year":"1996","unstructured":"Potra, F.A.: An infeasible interior-point predictor-corrector algorithm for linear programming. SIAM J. Optim. 6(1), 19\u201332 (1996)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9135_CR8","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1137\/050623917","volume":"16","author":"C. Roos","year":"2006","unstructured":"Roos, C.: A full-Newton step O(n) infeasible interior-point algorithm for linear optimization. SIAM J. Optim. 16(4), 1110\u20131136 (2006)","journal-title":"SIAM J. Optim."},{"key":"9135_CR9","volume-title":"Theory and Algorithms for Linear Optimization. An Interior Approach","author":"C. Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.-Ph.: Theory and Algorithms for Linear Optimization. An Interior Approach. Wiley, Chichester (1997)"},{"issue":"2","key":"9135_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s10589-005-3064-1","volume":"33","author":"M. Salahi","year":"2006","unstructured":"Salahi, M., Terlaky, T., Zhang, G.: The complexity of self-regular proximity based infeasible IPMs. Comput. Optim. Appl. 33(2), 157\u2013185 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"9135_CR11","volume-title":"Optimization Theory and Methods: Nonlinear Programming","author":"W. Sun","year":"2006","unstructured":"Sun, W., Yuan, Y.: Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006)"},{"issue":"1","key":"9135_CR12","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF02206818","volume":"62","author":"M.J. Todd","year":"1996","unstructured":"Todd, M.J., Ye, Y.: A lower bound on the number of iterations of long-step and polynomial interior-point linear programming algorithms. Ann. Oper. Res. 62(1), 233\u2013252 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9135_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.: Interior Point Algorithms: Theory and Analysis. Wiley, New York (1997)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-007-9135-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-007-9135-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-007-9135-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:09Z","timestamp":1559351289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-007-9135-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,10]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,11,15]]}},"alternative-id":["9135"],"URL":"https:\/\/doi.org\/10.1007\/s11075-007-9135-x","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,10]]}}}