{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:32:47Z","timestamp":1648999967703},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T00:00:00Z","timestamp":1428710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s11590-015-0889-0","type":"journal-article","created":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T00:23:01Z","timestamp":1428711781000},"page":"619-634","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An $$O(\\sqrt{n}L)$$ O ( n L ) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Changhe","family":"Liu","sequence":"first","affiliation":[]},{"given":"Youlin","family":"Shang","sequence":"additional","affiliation":[]},{"given":"Hongwei","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,11]]},"reference":[{"key":"889_CR1","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"Ai, W., Zhang, S.: An $$O(\\sqrt{n}L)$$ O ( n L ) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16, 400\u2013417 (2005)","journal-title":"SIAM J. Optim."},{"key":"889_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s101070050027","volume":"84","author":"ED Andersen","year":"1999","unstructured":"Andersen, E.D., Ye, Y.: On a homogeneous algorithm for the monotone complementarity problem. Math. Program. 84, 375\u2013399 (1999)","journal-title":"Math. Program."},{"key":"889_CR3","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1016\/j.apnum.2008.05.006","volume":"59","author":"C Cartis","year":"2009","unstructured":"Cartis, C.: Some disadvantages of a Mehrotra-tpye primal-dual corrector interior point algorithm for linear programming. Appl. Numer. Math. 59, 1110\u20131119 (2009)","journal-title":"Appl. Numer. Math."},{"key":"889_CR4","unstructured":"Cartis, C.: On the convergence of a primal-dual second-order corrector interior point algorithm for linear programming. Technical Report, Numerical Analysis Group, Computing Laboratory, Oxford University (2005). http:\/\/www.optimization-online.org\/DB_HTML\/2005\/03\/1097.html . Accessed April 2005"},{"key":"889_CR5","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, 277\u2013305 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"889_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-1-4613-9617-8_2","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A primal-dual interior point algorithm for linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 29\u201347. Springer, New York (1989)"},{"key":"889_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01587074","volume":"44","author":"M Kojima","year":"1989","unstructured":"Kojima, M., Mizuno, S., Yoshise, A.: A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. 44, 1\u201326 (1989)","journal-title":"Math. Program."},{"key":"889_CR8","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s11590-010-0242-6","volume":"5","author":"C Liu","year":"2011","unstructured":"Liu, C., Liu, H., Cong, W.: An $$O(\\sqrt{n}L)$$ O ( n L ) iteration primal-dual second-order corrector algorithm for linear programming. Optim. Lett. 5, 729\u2013743 (2011)","journal-title":"Optim. Lett."},{"key":"889_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-1-4613-9617-8_8","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N.: Pathways to the optimal set in linear programming. In: Megiddo, N. (ed.) Progress in Mathematical Programming: Interior Point and Related Methods, pp. 131\u2013158. Springer, New York (1989)"},{"key":"889_CR10","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, 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"key":"889_CR11","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, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"889_CR12","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.amc.2006.05.092","volume":"183","author":"M Salahi","year":"2006","unstructured":"Salahi, M., Mahdavi-Amiri, N.: Polynomial time second order Mehrotra-type predictor-corrector algorithms. Appl. Math. Comput. 183, 646\u2013658 (2006)","journal-title":"Appl. Math. Comput."},{"key":"889_CR13","doi-asserted-by":"crossref","first-page":"1377","DOI":"10.1137\/050628787","volume":"18","author":"M Salahi","year":"2007","unstructured":"Salahi, M., Peng, J., Terlaky, T.: On Mehrotra-type predictor-corrector algorithms. SIAM J. Optim. 18, 1377\u20131397 (2007)","journal-title":"SIAM J. Optim."},{"key":"889_CR14","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02614384","volume":"76","author":"Y Ye","year":"1996","unstructured":"Ye, Y.: On homogeneous and self-dual algorithms for LCP. Math. Program. 76, 211\u2013221 (1996)","journal-title":"Math. Program."},{"key":"889_CR15","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y Zhang","year":"1995","unstructured":"Zhang, Y., Zhang, D.T.: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms. Math. Program. 68, 303\u2013318 (1995)","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0889-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0889-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0889-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:42Z","timestamp":1559409102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0889-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,11]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["889"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0889-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,11]]}}}