{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T12:21:57Z","timestamp":1649074917882},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,7,23]],"date-time":"2011-07-23T00:00:00Z","timestamp":1311379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10589-011-9421-3","type":"journal-article","created":{"date-parts":[[2011,7,22]],"date-time":"2011-07-22T15:01:18Z","timestamp":1311346878000},"page":"373-391","source":"Crossref","is-referenced-by-count":1,"title":["A Predictor-corrector algorithm with multiple corrections for convex quadratic programming"],"prefix":"10.1007","volume":"52","author":[{"given":"Zhongyi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Yue","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Wenyu","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Zhihui","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,23]]},"reference":[{"issue":"3","key":"9421_CR1","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1018369223322","volume":"10","author":"E.D. Andersen","year":"1998","unstructured":"Andersen, E.D., Ye, Y.: A computational study of the homogeneous algorithm for large-scale convex optimization. Comput. Optim. Appl. 10(3), 243\u2013269 (1998)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9421_CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10957-006-9043-6","volume":"129","author":"S. Cafieri","year":"2006","unstructured":"Cafieri, S., D\u2019Apuzzo, M., Marino, M., Mucherino, A., Toraldo, G.: Interior-point solver for large-scale quadratic programming problems with bound constraints. J. Optim. Theory Appl. 129(1), 55\u201375 (2006)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"9421_CR3","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10589-007-9106-0","volume":"41","author":"M. Colombo","year":"2008","unstructured":"Colombo, M., Gondzio, J.: Further development of multiple centrality correctors for interior point methods. Comput. Optim. Appl. 41(3), 277\u2013305 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9421_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11075-006-9019-5","volume":"42","author":"J. Dominguez","year":"2006","unstructured":"Dominguez, J., Gonz\u00e1lez-Lima, M.D.: A primal-dual interior-point algorithm for quadratic programming. Numer. Algorithms 42(1), 1\u201330 (2006)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"9421_CR5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J. Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6(2), 137\u2013156 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"9421_CR6","first-page":"147","volume-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computing","author":"S. Kapoor","year":"1986","unstructured":"Kapoor, S., Vaidya, P.M.: Fast algorithms for convex quadratic programming and multicommodity flows. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing, California, 1986, pp. 147\u2013159 (1986)"},{"issue":"4","key":"9421_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"Karmarkar, N.K.: A new polynomial-time algorithm for linear programming. Combinatorica 4(4), 373\u2013395 (1984)","journal-title":"Combinatorica"},{"issue":"3","key":"9421_CR8","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M. Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61(3), 263\u2013280 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"9421_CR9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11075-007-9135-x","volume":"46","author":"Z. Liu","year":"2007","unstructured":"Liu, Z., Sun, W.: An infeasible interior-point algorithm with full-Newton step for linear optimization. Numer. Algorithms 46(2), 173\u2013188 (2007)","journal-title":"Numer. Algorithms"},{"issue":"1","key":"9421_CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/04060771X","volume":"17","author":"Z. Lu","year":"2006","unstructured":"Lu, Z., 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."},{"issue":"3","key":"9421_CR11","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":"4","key":"9421_CR12","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9421_CR13","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.: On adaptive step primal-dual interior-point algorithms for linear programming. Math. Oper. Res. 18(4), 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"9421_CR14","doi-asserted-by":"crossref","unstructured":"Monteiro, R.D.C., Adler, I.: Interior path following primal-dual algorithms, Part II: convex quadratic programming. Math. Program. (1989)","DOI":"10.1007\/BF01587076"},{"issue":"4","key":"9421_CR15","doi-asserted-by":"crossref","first-page":"1105","DOI":"10.1137\/040603991","volume":"15","author":"J. Peng","year":"2005","unstructured":"Peng, J., Terlaky, T., Zhao, Y.: A predictor-corrector algorithm for linear optimization based on a specific self-regular proximity function. SIAM J. Optim. 15(4), 1105\u20131127 (2005)","journal-title":"SIAM J. Optim."},{"key":"9421_CR16","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":"0","key":"9421_CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1018905724427","volume":"87","author":"F. Wu","year":"1999","unstructured":"Wu, F., Wu, S., Ye, Y.: On quadratic convergence of the $O(\\sqrt{n}L)$ -iteration homogeneous and self-dual linear programming algorithm. Ann. Oper. Res. 87(0), 393\u2013406 (1999)","journal-title":"Ann. Oper. Res."},{"key":"9421_CR18","unstructured":"Ye, Y., Tse, E.: A polynomial algorithm for convex programming. Working Paper, Department of Engineering-Economic Systems, Stanford University, Stanford, CA (1986)"},{"issue":"1","key":"9421_CR19","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y. Ye","year":"1994","unstructured":"Ye, Y., Todd, M.J., Mizuno, S.: An $O(\\sqrt{n})L$ -iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9421-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-011-9421-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-011-9421-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T06:20:13Z","timestamp":1560406813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-011-9421-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,23]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9421"],"URL":"https:\/\/doi.org\/10.1007\/s10589-011-9421-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,23]]}}}