{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:38:16Z","timestamp":1768315096039,"version":"3.49.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,5,11]],"date-time":"2012-05-11T00:00:00Z","timestamp":1336694400000},"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":[[2013,2]]},"DOI":"10.1007\/s11075-012-9581-y","type":"journal-article","created":{"date-parts":[[2012,5,10]],"date-time":"2012-05-10T03:02:12Z","timestamp":1336618932000},"page":"289-306","source":"Crossref","is-referenced-by-count":22,"title":["Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier"],"prefix":"10.1007","volume":"62","author":[{"given":"Xinzhong","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoqiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zihou","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,11]]},"reference":[{"issue":"1","key":"9581_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":"9581_CR2","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1137\/S1052623401398132","volume":"13","author":"YQ Bai","year":"2003","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A new efficient large-update primal-dual interior-point method based on a finite barrier. SIAM J. Optim. 13(3), 766\u2013782 (2003)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9581_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1137\/S1052623403423114","volume":"15","author":"YQ Bai","year":"2004","unstructured":"Bai, Y.Q., El Ghami, M., Roos, C.: A comparative study of kernel functions for primal-dual interior-point algorithms in linear optimization. SIAM J. Optim. 15(1), 101\u2013128 (2004)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9581_CR4","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1016\/j.cam.2008.05.027","volume":"224","author":"M Ghami El","year":"2009","unstructured":"El Ghami, M., Ivanov, I., Melissen, J.B.M., Roos, C., Steihaug, T.: A polynomial-time algorithm for linear optimization based on a new class of kernel functions. J. Comput. Appl. Math. 224(2), 500\u2013513 (2009)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"9581_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/04060771X","volume":"17","author":"ZS Lu","year":"2006","unstructured":"Lu, Z.S., Monteiro, R.D.C., O\u2019Neal, J.W.: An iterative solver-based infeasible primal-dual path-following algorithm for convex quadratic programming. SIAM J. Optim. 17(1), 287\u2013310 (2006)","journal-title":"SIAM J. Optim."},{"key":"9581_CR6","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0167-6377(99)00028-0","volume":"213","author":"C Meszaros","year":"1999","unstructured":"Meszaros, Cs.: Steplengths in interior-point algorithms of quadratic programming. Oper. Res. Lett. 213, 39\u201345 (1999)","journal-title":"Oper. Res. Lett."},{"key":"9581_CR7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01587076","volume":"44","author":"RDC Monteiro","year":"1989","unstructured":"Monteiro, R.D.C., Alder, I.: Interior-path following primal-dual algorithms: Part II: convex quadratic programming. Math. Program. 44, 43\u201366 (1989)","journal-title":"Math. Program."},{"issue":"1","key":"9581_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s101070200296","volume":"93","author":"J Peng","year":"2002","unstructured":"Peng, J., Roos, C., Terlaky, T.: Self-regular functions and new search directions for linear and semidefinite optimization Math. Program. 93(1), 129\u2013171 (2002)","journal-title":"Math. Program."},{"key":"9581_CR9","volume-title":"Theory and Algorithms for Linear Optimization. An Interior-Point Approach","author":"C Roos","year":"1997","unstructured":"Roos, C., Terlaky, T., Vial, J.Ph.: Theory and Algorithms for Linear Optimization. An Interior-Point Approach. Wiley, Chichester, UK (1997)"},{"issue":"3","key":"9581_CR10","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s11741-008-0301-3","volume":"12","author":"GQ Wang","year":"2008","unstructured":"Wang, G.Q., Bai, Y.Q., Liu, Y., Zhang, M.: A new primal-dual interior-point algorithm for convex quadratic optimization. J. Shanghai Univ. 12(3), 189\u2013196 (2008)","journal-title":"J. Shanghai Univ."},{"key":"9581_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"key":"9581_CR12","volume-title":"Interior-Point Methods for Linear Optimization","author":"Y Ye","year":"2006","unstructured":"Ye, Y.: Interior-Point Methods for Linear Optimization. Springer, New York, USA (2006)"},{"issue":"2","key":"9581_CR13","first-page":"263","volume":"26B","author":"Q Yu","year":"2006","unstructured":"Yu, Q., Huang, C.C., Jiang, Y.: A polynomial predictor-corrector interior-point algorithm for convex quadratic programming. Acta Math. Sci. Ser. B Engl. Ed. 26B(2), 263\u2013270 (2006)","journal-title":"Acta Math. Sci. Ser. B Engl. Ed."}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9581-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-012-9581-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-012-9581-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:08:18Z","timestamp":1559351298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-012-9581-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,11]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9581"],"URL":"https:\/\/doi.org\/10.1007\/s11075-012-9581-y","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,11]]}}}