{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T17:21:44Z","timestamp":1715620904631},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,12,5]],"date-time":"2017-12-05T00:00:00Z","timestamp":1512432000000},"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":["Period Math Hung"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10998-017-0231-y","type":"journal-article","created":{"date-parts":[[2017,12,5]],"date-time":"2017-12-05T08:20:19Z","timestamp":1512462019000},"page":"243-264","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Polynomial convergence of two higher order interior-point methods for \n                $$P_*(\\kappa )$$\n                \n                    \n                        \n                            \n                                P\n                                \n                                    \n                                    \u2217\n                                \n                            \n                            \n                                (\n                                \u03ba\n                                )\n                            \n                        \n                    \n                \n            -LCP in a wide neighborhood of the central path"],"prefix":"10.1007","volume":"76","author":[{"given":"Behrouz","family":"Kheirfam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maryam","family":"Chitsaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,5]]},"reference":[{"key":"231_CR1","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"W. Ai, S. Zhang, An \n                        $$O(\\sqrt{n}L)$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    \n                                        n\n                                    \n                                    L\n                                    )\n                                \n                            \n                        \n                     iteration primal\u2013dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SAIM J. Optim. 16, 400\u2013417 (2005)","journal-title":"SAIM J. Optim."},{"issue":"3","key":"231_CR2","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF00940344","volume":"60","author":"SJ Chung","year":"1989","unstructured":"S.J. Chung, NP-completeness of the linear complementarity problem. J. Optim. Theory Appl. 60(3), 393\u2013399 (1989)","journal-title":"J. Optim. Theory Appl."},{"issue":"115","key":"231_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0024-3795(89)90463-1","volume":"114","author":"RW Cottle","year":"1989","unstructured":"R.W. Cottle, J.-S. Pang, V. Venkateswaran, Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. 114(115), 231\u2013249 (1989)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"231_CR4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10107-011-0465-z","volume":"129","author":"E Klerk De","year":"2011","unstructured":"E. De Klerk, M. Nagy, On the complexity of computing the handicap of a sufficient matrix. Math. Program. 129(2), 383\u2013402 (2011)","journal-title":"Math. Program."},{"issue":"4","key":"231_CR5","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/01630563.2011.652269","volume":"33","author":"Z Feng","year":"2012","unstructured":"Z. Feng, A new \n                        $$O(\\sqrt{n}L)$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    \n                                        n\n                                    \n                                    L\n                                    )\n                                \n                            \n                        \n                     iteration large-update primal\u2013dual interior-point method for second-order cone programming. Numer. Funct. Anal. Optim. 33(4), 397\u2013414 (2012)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"1\u20133","key":"231_CR6","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0166-218X(97)00143-1","volume":"84","author":"K Fukuda","year":"1998","unstructured":"K. Fukuda, M. Namiki, A. Tamura, EP theorems and linear complementarity problems. Discrete Appl. Math. 84(1\u20133), 107\u2013119 (1998)","journal-title":"Discrete Appl. Math."},{"key":"231_CR7","first-page":"325","volume":"223\u2013224","author":"SM Guu","year":"1995","unstructured":"S.M. Guu, R.W. Cottle, On a subclass of P0. Linear Algebra Appl. 223\u2013224, 325\u2013335 (1995)","journal-title":"Linear Algebra Appl."},{"issue":"3","key":"231_CR8","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/j.ejor.2005.08.031","volume":"181","author":"T Ill\u00e9s","year":"2007","unstructured":"T. Ill\u00e9s, M. Nagy, A new variant of the Mizuno-Todd-Ye predictor\u2013corrector algorithm for sufficient matrix linear complementarity problem. Eur. J. Oper. Res. 181(3), 1097\u20131111 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"231_CR9","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10957-008-9440-0","volume":"140","author":"T Ill\u00e9s","year":"2009","unstructured":"T. Ill\u00e9s, M. Nagy, T. Terlaky, EP theorem for dual linear complementarity problem. J. Optim. Theory Appl. 140, 233\u2013238 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"231_CR10","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Ill\u00e9s","year":"2010","unstructured":"T. Ill\u00e9s, M. Nagy, T. Terlaky, A polynomial path-following interior point algorithm for general linear complementarity problems. J. Global Optim. 47(3), 329\u2013342 (2010)","journal-title":"J. Global Optim."},{"key":"231_CR11","first-page":"1","volume":"5","author":"T Ill\u00e9s","year":"2010","unstructured":"T. Ill\u00e9s, M. Nagy, T. Terlaky, Polynomial interior point algorithms for general linear complementarity problems. Algorithmic Oper. Res. 5, 1\u201312 (2010)","journal-title":"Algorithmic Oper. Res."},{"key":"231_CR12","unstructured":"T. Ill\u00e9s, C. Roos, T. Terlaky, Polynomial Affine-Scaling Algorithms for \n                    \n                        $$P_*(\\kappa )$$\n                        \n                            \n                                \n                                    \n                                        P\n                                        \n                                            \n                                            \u2217\n                                        \n                                    \n                                    \n                                        (\n                                        \u03ba\n                                        )\n                                    \n                                \n                            \n                        \n                    \u00a0\u00a0Linear Complementarity Problems, in P. Gritzmann, R. Horst, E. Sachs, R. Tichatschke, (eds.), Recent Advances in Optimization, Proceedings of the \n                        $$8^{th}$$\n                        \n                            \n                                \n                                    \n                                        8\n                                        \n                                            th\n                                        \n                                    \n                                \n                            \n                        \n                     French\u2013German Conference on Optimization, Trier, July 21\u201326, 1996, Lecture Notes in Economics and Mathematical Systems 452 (Springer Verlag, 1997), pp. 119\u2013137"},{"key":"231_CR13","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1137\/S1052623493262348","volume":"7","author":"B Jansen","year":"1996","unstructured":"B. Jansen, C. Roos, T. Terlaky, A family of polynomial affine scaling algorithms for positive semidefinite linear complementarity problems. SIAM J. Optim. 7, 126\u2013140 (1996)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"231_CR14","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s11075-013-9738-3","volume":"66","author":"B Kheirfam","year":"2014","unstructured":"B. Kheirfam, A predictor\u2013corrector interior-point algorithm for \n                        $$P_*(\\kappa )$$\n                        \n                            \n                                \n                                    \n                                        P\n                                        \n                                            \n                                            \u2217\n                                        \n                                    \n                                    \n                                        (\n                                        \u03ba\n                                        )\n                                    \n                                \n                            \n                        \n                    -horizontal linear complementarity problem. Numer. Algorithms 66(2), 349\u2013361 (2014)","journal-title":"Numer. Algorithms"},{"key":"231_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-54509-3","volume-title":"A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science","author":"M Kojima","year":"1991","unstructured":"M. Kojima, N. Megiddo, T. Noma, A. Yoshise, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science, vol. 538 (Springer, New York, 1991)"},{"key":"231_CR16","doi-asserted-by":"crossref","first-page":"2853","DOI":"10.1137\/080729311","volume":"20","author":"Y Li","year":"2010","unstructured":"Y. Li, T. Terlaky, A new class of large neighborhood path-following interior-point algorithms for semidefinite optimization with \n                        $$O(\\sqrt{n}\\log (\\text{ Tr }(X^0S^0)\/\\epsilon ))$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    \n                                        n\n                                    \n                                    log\n                                    \n                                        (\n                                        \n                                        Tr\n                                        \n                                        \n                                            (\n                                            \n                                                X\n                                                0\n                                            \n                                            \n                                                S\n                                                0\n                                            \n                                            )\n                                        \n                                        \/\n                                        \u03f5\n                                        )\n                                    \n                                    )\n                                \n                            \n                        \n                     iteration complexity. SIAM J. Optim. 20, 2853\u20132875 (2010)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"231_CR17","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1137\/050623723","volume":"17","author":"X Liu","year":"2006","unstructured":"X. Liu, F.A. Potra, Corrector\u2013predictor methods for sufficient linear complementarity problems in a wide neighborhood of the central path. SIAM J. Optim. 17(3), 871\u2013890 (2006)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"231_CR18","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1007\/s10957-013-0303-y","volume":"158","author":"H Liu","year":"2013","unstructured":"H. Liu, X. Yang, C. Liu, A new wide neighborhood primal\u2013dual infeasible-interior-point method for symmetric cone programming. J. Optim. Theory Appl. 158(3), 796\u2013815 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"231_CR19","first-page":"355","volume":"69","author":"J Miao","year":"1995","unstructured":"J. Miao, A quadratically convergent \n                        $$O((1+\\kappa )\\sqrt{n}L)$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    \n                                        (\n                                        1\n                                        +\n                                        \u03ba\n                                        )\n                                    \n                                    \n                                        n\n                                    \n                                    L\n                                    )\n                                \n                            \n                        \n                    -iteration algorithm for the \n                        $$P_*(\\kappa )$$\n                        \n                            \n                                \n                                    \n                                        P\n                                        \n                                            \n                                            \u2217\n                                        \n                                    \n                                    \n                                        (\n                                        \u03ba\n                                        )\n                                    \n                                \n                            \n                        \n                    -matrix linear complementarity problem. Math. Program. 69, 355\u2013368 (1995)","journal-title":"Math. Program."},{"key":"231_CR20","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/moor.18.4.964","volume":"18","author":"S Mizuno","year":"1993","unstructured":"S. Mizuno, M.J. Todd, Y. Ye, On adaptive-step primal\u2013dual interior point algorithms for linear programming. Math. Oper. Res. 18, 964\u2013981 (1993)","journal-title":"Math. Oper. Res."},{"key":"231_CR21","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10107-006-0068-2","volume":"111","author":"FA Potra","year":"2008","unstructured":"F.A. Potra, Corrector\u2013predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path. Math. Program. 111, 243\u2013272 (2008)","journal-title":"Math. Program."},{"issue":"1","key":"231_CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1080\/10556780512331318038","volume":"20","author":"FA Potra","year":"2005","unstructured":"F.A. Potra, X. Liu, Predictor\u2013corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path. Optim. Methods Softw. 20(1), 145\u2013168 (2005)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"231_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/120884341","volume":"24","author":"FA Potra","year":"2014","unstructured":"F.A. Potra, Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity. SIAM J. Optim. 24(1), 1\u201328 (2014)","journal-title":"SIAM J. Optim."},{"key":"231_CR24","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1137\/S1052623495279359","volume":"7","author":"FA Potra","year":"1997","unstructured":"F.A. Potra, R. Sheng, A large-step infeasible-interior-point method for the \n                        $$P_*$$\n                        \n                            \n                                \n                                    P\n                                    \n                                        \n                                        \u2217\n                                    \n                                \n                            \n                        \n                    -matrix LCP. SIAM J. Optim. 7, 318\u2013335 (1997)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"231_CR25","doi-asserted-by":"crossref","first-page":"1333","DOI":"10.1137\/080716979","volume":"20","author":"FA Potra","year":"2009","unstructured":"F.A. Potra, J. Stoer, On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP. SIAM J. Optim. 20(3), 1333\u20131363 (2009)","journal-title":"SIAM J. Optim."},{"key":"231_CR26","unstructured":"C. Roos, T. Terlaky, J.-P. Vial, Theory and Algorithms for Linear Optimization, An Interior-Point Approach. (Wiley, Chichester, 1997). (2nd ed., Springer, 2005)"},{"issue":"4","key":"231_CR27","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/moor.23.4.832","volume":"23","author":"J Stoer","year":"1998","unstructured":"J. Stoer, M. Wechs, S. Mizuno, High order infeasible-interior-point methods for solving sufficient linear complementarity problems. Math. Oper. Res. 23(4), 832\u2013862 (1998)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"231_CR28","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1080\/10556789808805721","volume":"10","author":"J Stoer","year":"1998","unstructured":"J. Stoer, M. Wechs, The complexity of high-order predictor\u2013corrector methods for solving sufficient linear complementarity problems. Optim. Methods Softw. 10(2), 393\u2013417 (1998)","journal-title":"Optim. Methods Softw."},{"key":"231_CR29","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s101070000159","volume":"88","author":"P Tseng","year":"2000","unstructured":"P. Tseng, Co-NP-completeness of some matrix classification problems. Math. Program. 88, 183\u2013192 (2000)","journal-title":"Math. Program."},{"key":"231_CR30","first-page":"103","volume":"239","author":"H V\u00e4liaho","year":"1996","unstructured":"H. V\u00e4liaho, \n                        $$P_*$$\n                        \n                            \n                                \n                                    P\n                                    \n                                        \n                                        \u2217\n                                    \n                                \n                            \n                        \n                    -matrices are just sufficient. Linear Algebra Appl. 239, 103\u2013108 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"1\u20133","key":"231_CR31","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0024-3795(95)00703-2","volume":"253","author":"H V\u00e4liaho","year":"1997","unstructured":"H. V\u00e4liaho, Determining the handicap of a sufficient matrix. Linear Algebra Appl. 253(1\u20133), 279\u2013298 (1997)","journal-title":"Linear Algebra Appl."},{"issue":"1\u20132","key":"231_CR32","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s12190-015-0900-z","volume":"51","author":"X Yang","year":"2016","unstructured":"X. Yang, Y. Zhang, H. Liu, A wide neighborhood infeasible-interior-point method with arc-search for linear programming. J. Appl. Math. Comput. 51(1\u20132), 209\u2013225 (2016)","journal-title":"J. Appl. Math. Comput."},{"issue":"3","key":"231_CR33","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1007\/BF01585182","volume":"62","author":"Y Ye","year":"1993","unstructured":"Y. Ye, K. Anstreicher, On quadratic and \n                        $$O(\\sqrt{n}L)$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    \n                                        n\n                                    \n                                    L\n                                    )\n                                \n                            \n                        \n                     convergence of predictor\u2013corrector algorithm for LCP. Math. Program. 62(3), 537\u2013551 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"231_CR34","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF01581242","volume":"59","author":"Y Ye","year":"1993","unstructured":"Y. Ye, O. G\u00fcler, R.A. Tapia, Y. Zhang, A quadratically convergent \n                        $$O(\\sqrt{n}L)$$\n                        \n                            \n                                \n                                    O\n                                    (\n                                    \n                                        n\n                                    \n                                    L\n                                    )\n                                \n                            \n                        \n                    -iteration algorithm for linear programming. Math. Program. 59(2), 151\u2013162 (1993)","journal-title":"Math. Program."}],"container-title":["Periodica Mathematica Hungarica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10998-017-0231-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-017-0231-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10998-017-0231-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,22]],"date-time":"2018-05-22T09:58:41Z","timestamp":1526983121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10998-017-0231-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,5]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["231"],"URL":"https:\/\/doi.org\/10.1007\/s10998-017-0231-y","relation":{},"ISSN":["0031-5303","1588-2829"],"issn-type":[{"value":"0031-5303","type":"print"},{"value":"1588-2829","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,5]]}}}