{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:58:58Z","timestamp":1649163538761},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T00:00:00Z","timestamp":1468368000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10288-016-0325-z","type":"journal-article","created":{"date-parts":[[2016,7,13]],"date-time":"2016-07-13T13:01:30Z","timestamp":1468414890000},"page":"111-131","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An \n                $$\\ell _{2}$$\n                \n                    \n                                    \n                        \n                            \u2113\n                            2\n                        \n                    \n                \n            -neighborhood infeasible interior-point algorithm for linear complementarity problems"],"prefix":"10.1007","volume":"15","author":[{"given":"M.","family":"Pirhaji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zangiabadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Mansouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"key":"325_CR1","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"Ai W, Zhang SZ (2005) An \n                        $$O(\\sqrt{n}L)$$\n                        \n                            \n                                            \n                                \n                                    O\n                                    (\n                                    \n                                        n\n                                    \n                                    L\n                                    )\n                                \n                            \n                        \n                     iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J Optim 16:400\u2013417","journal-title":"SIAM J Optim"},{"key":"325_CR2","volume-title":"Differential geometry of curves and surfaces","author":"MP Carmo","year":"1976","unstructured":"Carmo MP (1976) Differential geometry of curves and surfaces. Prentice-Hall, Upper Saddle River"},{"key":"325_CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N Karmarkar","year":"1984","unstructured":"Karmarkar N (1984) A new polynomial-time algorithm for linear programming. Combinatorica 4:373\u2013395","journal-title":"Combinatorica"},{"key":"325_CR4","doi-asserted-by":"crossref","unstructured":"Kojima M, Megiddo N, Noma T, Yoshise A (1991) A unified approach to interior point algorithms for linear complementarity problems. Lecture Notes in Computer Science, vol. 538, Springer, New York","DOI":"10.1007\/3-540-54509-3"},{"key":"325_CR5","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 (1993) A primal-dual infeasible-interior-point algorithm for linear programming. Math Progr 61:263\u2013280","journal-title":"Math Progr"},{"key":"325_CR6","doi-asserted-by":"crossref","first-page":"2853","DOI":"10.1137\/080729311","volume":"20","author":"Y Li","year":"2010","unstructured":"Li Y, Terlaky T (2010) A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \n                        $$O({\\sqrt{n}\\log ({\\frac{Tr({X^0S^0})}{\\varepsilon }})})$$\n                        \n                            \n                                            \n                                \n                                    O\n                                    (\n                                    \n                                        \n                                            n\n                                        \n                                        log\n                                        \n                                            (\n                                            \n                                                \n                                                    T\n                                                    r\n                                                    (\n                                                    \n                                                        \n                                                            X\n                                                            0\n                                                        \n                                                        \n                                                            S\n                                                            0\n                                                        \n                                                    \n                                                    )\n                                                \n                                                \u03b5\n                                            \n                                            )\n                                        \n                                    \n                                    )\n                                \n                            \n                        \n                     iteration complexity. SIAM J Optim 20:2853\u20132875","journal-title":"SIAM J Optim"},{"key":"325_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s11075-011-9530-1","volume":"61","author":"Z Lipu","year":"2012","unstructured":"Lipu Z, Yanqin B, Yinghong X (2012) A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function. Numer Algor 61:57\u201381","journal-title":"Numer Algor"},{"key":"325_CR8","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.nonrwa.2010.06.039","volume":"12","author":"H Mansouri","year":"2011","unstructured":"Mansouri H, Zangiabadi M, Pirhaji M (2011) A full-Newton step \n                        $$O(n)$$\n                        \n                            \n                                            \n                                \n                                    O\n                                    (\n                                    n\n                                    )\n                                \n                            \n                        \n                     infeasible interior-point algorithm for linear complementarity problems. Nonlinear Anal Real World Appl 12:545\u2013561","journal-title":"Nonlinear Anal Real World Appl"},{"key":"325_CR9","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02206812","volume":"62","author":"FA Potra","year":"1996","unstructured":"Potra FA (1996) An \n                        $$O(nL)$$\n                        \n                            \n                                            \n                                \n                                    O\n                                    (\n                                    n\n                                    L\n                                    )\n                                \n                            \n                        \n                     infeasible-interior-point algorithm for LCP with quadratic convergence. Ann Oper Res 62:81\u2013102","journal-title":"Ann Oper Res"},{"key":"325_CR10","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.ejor.2011.06.020","volume":"215","author":"Y Yang","year":"2011","unstructured":"Yang Y (2011) A polynomial arc-search interior-point algorithm for convex quadratic programming. Eur J Oper Res 215:25\u201338","journal-title":"Eur J Oper Res"},{"key":"325_CR11","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/s10957-013-0281-0","volume":"158","author":"Y Yang","year":"2013","unstructured":"Yang Y (2013) A polynomial arc-search interior-point algorithm for linear programming. J Optim Theory Appl 158:859\u2013873","journal-title":"J Optim Theory Appl"},{"key":"325_CR12","unstructured":"Yang Y (2014) Arc search infeasible interior-point algorithm for linear programming. \n                        arXiv:1406.4539\n                        \n                     [math.OC]"},{"key":"325_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-014-0670-z","author":"X Yang","year":"2014","unstructured":"Yang X, Li H, Zhang Y (2014) A new sterategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming. J Optim Theory Appl. doi:\n                        10.1007\/s10957-014-0670-z","journal-title":"J Optim Theory Appl"},{"key":"325_CR14","unstructured":"Yang Y, Makoto Y (2015) An \n                        $$O(nL)$$\n                        \n                            \n                                            \n                                \n                                    O\n                                    (\n                                    n\n                                    L\n                                    )\n                                \n                            \n                        \n                     infeasible interior-point algorithm for linear programming. \n                        arXiv:1506.06365\n                        \n                     [math.OC]"},{"key":"325_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-015-0900-z","author":"X Yang","year":"2015","unstructured":"Yang X, Zhang Y, Liu H (2015) A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J Appl Math Comput. doi:\n                        10.1007\/s12190-015-0900-z","journal-title":"J Appl Math Comput"},{"key":"325_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-0997-5","author":"X Yang","year":"2016","unstructured":"Yang X, Liu H, Zhang Y (2016) An arc-search infeasible -interior-point method for symmetric optimization in a wide neighborhood of the central path. Optim Lett. doi:\n                        10.1007\/s11590-016-0997-5","journal-title":"Optim Lett"},{"key":"325_CR17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01585769","volume":"68","author":"Y Zhang","year":"1995","unstructured":"Zhang Y, Zhang D (1995) On polynomiality of the Mehrotra-type predictor corrector interior-point algorithms. Math Progr 68:303\u2013318","journal-title":"Math Progr"},{"key":"325_CR18","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang Y (1994) On the convergence of a class of infeasible interior-point methods for horizantal linear copmlementarity problem. SIAM J Optim 4:208\u2013227","journal-title":"SIAM J Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-016-0325-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0325-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0325-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-016-0325-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,25]],"date-time":"2017-05-25T08:07:38Z","timestamp":1495699658000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-016-0325-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,13]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["325"],"URL":"https:\/\/doi.org\/10.1007\/s10288-016-0325-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,13]]}}}