{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:23:50Z","timestamp":1773347030369,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T00:00:00Z","timestamp":1450828800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T00:00:00Z","timestamp":1450828800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1311923"],"award-info":[{"award-number":["DMS-1311923"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10589-015-9811-z","type":"journal-article","created":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T10:43:02Z","timestamp":1450867382000},"page":"467-488","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Sufficient weighted complementarity problems"],"prefix":"10.1007","volume":"64","author":[{"given":"Florian A.","family":"Potra","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,23]]},"reference":[{"issue":"2","key":"9811_CR1","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/040604492","volume":"16","author":"W Ai","year":"2005","unstructured":"Ai, W., Zhang, S.: An $$O(\\sqrt{n}L)$$ iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP. SIAM J. Optim. 16(2), 400\u2013417 (2005). (electronic)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9811_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.amc.2008.11.002","volume":"207","author":"K Amini","year":"2009","unstructured":"Amini, K., Peyghami, M.: Exploring complexity of large update interior-point methods for $$P_*(\\kappa )$$ linear complementarity problem based on kernel function. Appl. Math. Comput. 207(2), 501\u2013513 (2009)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"9811_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1080\/10556789708805657","volume":"7","author":"M Anitescu","year":"1997","unstructured":"Anitescu, M., Lesaja, G., Potra, F.A.: Equivalence between different formulations of the linear complementarity problem. Optim. Methods Softw. 7(3), 265\u2013290 (1997)","journal-title":"Optim. Methods Softw."},{"issue":"4\u20135","key":"9811_CR4","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/10556788.2011.644791","volume":"27","author":"KM Anstreicher","year":"2012","unstructured":"Anstreicher, K.M.: Interior-point algorithms for a generalization of linear programming and weighted centring. Optim. Methods Softw. 27(4\u20135), 605\u2013612 (2012)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9811_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01581079","volume":"57","author":"DS Atkinson","year":"1992","unstructured":"Atkinson, D.S., Vaidya, P.M.: A scaling technique for finding the weighted analytic center of a polytope. Math. Progr. 57(2), 163\u2013192 (1992)","journal-title":"Math. Progr."},{"issue":"1","key":"9811_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cam.2007.05.007","volume":"216","author":"GM Cho","year":"2008","unstructured":"Cho, G.M.: A new large-update interior point algorithm for $$P_*(\\kappa )$$ linear complementarity problems. J. Comput. Appl. Math. 216(1), 265\u2013278 (2008)","journal-title":"J. Comput. Appl. Math."},{"issue":"6","key":"9811_CR7","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1016\/j.camwa.2006.12.004","volume":"53","author":"GM Cho","year":"2007","unstructured":"Cho, G.M., Kim, M.K., Lee, Y.H.: Complexity of large-update interior point algorithm for $$P_\\ast (\\kappa )$$ linear complementarity problems. Comput. Math. Appl. 53(6), 948\u2013960 (2007)","journal-title":"Comput. Math. Appl."},{"key":"9811_CR8","volume-title":"The Linear Complementarity Problem","author":"RW Cottle","year":"1992","unstructured":"Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problem. Academic Press, Boston (1992)"},{"issue":"115","key":"9811_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0024-3795(89)90463-1","volume":"114","author":"RW Cottle","year":"1989","unstructured":"Cottle, R.W., Pang, J.S., Venkateswaran, V.: Sufficient matrices and the linear complementarity problem. Linear Algebra Appl. 114(115), 231\u2013249 (1989)","journal-title":"Linear Algebra Appl."},{"key":"9811_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1214\/aoms\/1177706369","volume":"30","author":"E Eisenberg","year":"1959","unstructured":"Eisenberg, E., Gale, D.: Consensus of subjective probabilities: the pari-mutuel method. Ann. Math. Statist. 30, 165\u2013168 (1959)","journal-title":"Ann. Math. Statist."},{"issue":"3","key":"9811_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01581277","volume":"58","author":"RM Freund","year":"1993","unstructured":"Freund, R.M.: Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the $${\\rm w}$$-center problem. Math. Progr. 58(3), 385\u2013414 (1993)","journal-title":"Math. Progr."},{"issue":"1","key":"9811_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0893-9659(94)00118-V","volume":"8","author":"MS Gowda","year":"1995","unstructured":"Gowda, M.S.: Reducing a monotone horizontal LCP to an LCP. Appl. Math. Lett. 8(1), 97\u2013100 (1995)","journal-title":"Appl. Math. Lett."},{"issue":"2","key":"9811_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.20.2.441","volume":"20","author":"O G\u00fcler","year":"1995","unstructured":"G\u00fcler, O.: Generalized linear complementarity problems. Math. Oper. Res. 20(2), 441\u2013448 (1995)","journal-title":"Math. Oper. Res."},{"issue":"3","key":"9811_CR14","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10589-009-9263-4","volume":"48","author":"F Gurtuna","year":"2011","unstructured":"Gurtuna, F., Petra, C., Potra, F.A., Shevchenko, O., Vancea, A.: Corrector-predictor methods for sufficient linear complementarity problems. Comput. Optim. Appl. 48(3), 453\u2013485 (2011)","journal-title":"Comput. Optim. Appl."},{"issue":"224","key":"9811_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0024-3795(93)00271-Z","volume":"223","author":"SM Guu","year":"1995","unstructured":"Guu, S.M., Cottle, R.W.: On a subclass of $${ P}_0$$. Linear Algebra Appl. 223(224), 325\u2013335 (1995)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"9811_CR16","first-page":"1","volume":"5","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: Polynomial interior point algorithms for general linear complementarity problems. Algorithm. Oper. Res. 5(1), 1\u201312 (2010)","journal-title":"Algorithm. Oper. Res."},{"issue":"3","key":"9811_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10898-008-9348-0","volume":"47","author":"T Ill\u00e9s","year":"2010","unstructured":"Ill\u00e9s, T., Nagy, M., Terlaky, T.: 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."},{"issue":"2","key":"9811_CR18","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1137\/S1052623498336590","volume":"11","author":"T Ill\u00e9s","year":"2000","unstructured":"Ill\u00e9s, T., Peng, J., Roos, C., Terlaky, T.: A strongly polynomial rounding procedure yielding a maximally complementary solution for $$P_*(\\kappa )$$ linear complementarity problems. SIAM J. Optim. 11(2), 320\u2013340 (2000). (electronic)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9811_CR19","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s11075-013-9738-3","volume":"66","author":"B Kheirfam","year":"2014","unstructured":"Kheirfam, B.: A predictor-corrector interior-point algorithm for $$P_*(\\kappa )$$-horizontal linear complementarity problem. Numer. Algorithms 66(2), 349\u2013361 (2014)","journal-title":"Numer. Algorithms"},{"issue":"2","key":"9811_CR20","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-011-0465-z","volume":"129","author":"E de Klerk","year":"2011","unstructured":"de Klerk, E., E.-Nagy, M.: On the complexity of computing the handicap of a sufficient matrix. Math. Program. 129(2), 383\u2013402 (2011)","journal-title":"Math. Program."},{"key":"9811_CR21","doi-asserted-by":"publisher","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":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Computer Science, vol. 538. Springer, New York (1991)"},{"issue":"3","key":"9811_CR22","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1137\/050623723","volume":"17","author":"X Liu","year":"2006","unstructured":"Liu, X., Potra, F.A.: Corrector-predictor 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":"1\u20132, Ser. B","key":"9811_CR23","first-page":"243","volume":"111","author":"FA Potra","year":"2008","unstructured":"Potra, F.A.: Corrector-predictor methods for monontone linear complementarity problems in a wide neighborhood of the central path. Math. Program. 111(1\u20132, Ser. B), 243\u2013272 (2008)","journal-title":"Math. Program."},{"issue":"4","key":"9811_CR24","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1137\/110837310","volume":"22","author":"FA Potra","year":"2012","unstructured":"Potra, F.A.: Weighted complementarity problems\u2013a new paradigm for computing equilibria. SIAM J. Optim. 22(4), 1634\u20131654 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9811_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/120884341","volume":"24","author":"FA Potra","year":"2014","unstructured":"Potra, F.A.: 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."},{"issue":"1","key":"9811_CR26","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1080\/10556780512331318038","volume":"20","author":"FA Potra","year":"2005","unstructured":"Potra, F.A., Liu, X.: Predictor-corrector 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."},{"key":"9811_CR27","volume-title":"Convex analysis. Princeton Mathematical Series","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex analysis. Princeton Mathematical Series, vol. 28. Princeton University Press, Princeton (1970)"},{"key":"9811_CR28","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1012951021320","volume":"103","author":"J Stoer","year":"2001","unstructured":"Stoer, J.: High order long-step methods for solving linear complementarity problems. Ann. Oper. Res. 103, 149\u2013159 (2001)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9811_CR29","first-page":"407","volume":"83","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M.: Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity. Math. Progr. 83(3), 407\u2013423 (1998)","journal-title":"Math. Progr."},{"issue":"4","key":"9811_CR30","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1287\/moor.23.4.832","volume":"23","author":"J Stoer","year":"1998","unstructured":"Stoer, J., Wechs, M., Mizuno, S.: 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."},{"key":"9811_CR31","first-page":"103","volume":"239","author":"H V\u00e4liaho","year":"1996","unstructured":"V\u00e4liaho, H.: $${P}_*$$-matrices are just sufficient. Linear Algebra Appl. 239, 103\u2013108 (1996)","journal-title":"Linear Algebra Appl."},{"issue":"1\u20132, Ser. B","key":"9811_CR32","first-page":"315","volume":"111","author":"Y Ye","year":"2008","unstructured":"Ye, Y.: A path to the Arrow-Debreu competitive market equilibrium. Math. Program. 111(1\u20132, Ser. B), 315\u2013348 (2008)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9811-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9811-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9811-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9811-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T09:57:58Z","timestamp":1718272678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9811-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,23]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9811"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9811-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,23]]},"assertion":[{"value":"21 October 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2015","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}