{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:23:49Z","timestamp":1773347029586,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T00:00:00Z","timestamp":1596672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T00:00:00Z","timestamp":1596672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10957-020-01728-4","type":"journal-article","created":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T14:02:47Z","timestamp":1596722567000},"page":"864-878","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["A Full-Newton Step Interior-Point Method for Monotone Weighted Linear Complementarity Problems"],"prefix":"10.1007","volume":"186","author":[{"given":"Soodabeh","family":"Asadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsolt","family":"Darvay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Goran","family":"Lesaja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nezam","family":"Mahdavi-Amiri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Potra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,6]]},"reference":[{"key":"1728_CR1","doi-asserted-by":"publisher","first-page":"1634","DOI":"10.1137\/110837310","volume":"2","author":"FA Potra","year":"2012","unstructured":"Potra, F.A.: Weighted complementarity problems\u2014a new paradigm for computing equilibria. SIAM J. Optim. 2, 1634\u20131654 (2012)","journal-title":"SIAM J. Optim."},{"key":"1728_CR2","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/10556788.2011.644791","volume":"2","author":"KM Anstreicher","year":"2012","unstructured":"Anstreicher, K.M.: Interior-point algorithms for a generalization of linear programming and weighted centering. Optim. Methods Soft. 2, 605\u2013612 (2012)","journal-title":"Optim. Methods Soft."},{"key":"1728_CR3","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10107-006-0065-5","volume":"111","author":"Y Ye","year":"2008","unstructured":"Ye, Y.: A path to the Arrow\u2013Debreu competitive market equilibrium. Math. Program. 111, 315\u2013348 (2008)","journal-title":"Math. Program."},{"key":"1728_CR4","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/0804014","volume":"4","author":"KA McShane","year":"1994","unstructured":"McShane, K.A.: Superlinearly convergent $$O(\\sqrt{n} L)$$-iteration interior-point algorithms for linear programming and the monotone linear complementarity problem. SIAM J. Optim. 4, 247\u2013261 (1994)","journal-title":"SIAM J. Optim."},{"key":"1728_CR5","doi-asserted-by":"publisher","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":"1728_CR6","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10589-015-9811-z","volume":"64","author":"FA Potra","year":"2016","unstructured":"Potra, F.A.: Sufficient weighted complementarity problems. Comput. Optim. Appl. 64, 467\u2013488 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"115","key":"1728_CR7","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":"1728_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s11590-015-0877-4","volume":"10","author":"J Zhang","year":"2016","unstructured":"Zhang, J.: A smoothing Newton algorithm for weighted linear complementarity problem. Optim. Lett. 10, 499\u2013509 (2016)","journal-title":"Optim. Lett."},{"key":"1728_CR9","doi-asserted-by":"publisher","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.: A full-Newton step $$O(n)$$ infeasible interior-point algorithm for linear complementarity problems. Nonlinear Anal. Real World Appl. 12, 545\u2013561 (2011)","journal-title":"Nonlinear Anal. Real World Appl."},{"key":"1728_CR10","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s11075-012-9628-0","volume":"63","author":"S Asadi","year":"2013","unstructured":"Asadi, S., Mansouri, H.: Polynomial interior-point algorithm for $$P_*(\\kappa )$$ horizontal linear complementarity problems. Numer. Algorithms 63, 385\u2013398 (2013)","journal-title":"Numer. Algorithms"},{"key":"1728_CR11","first-page":"51","volume":"5","author":"Z Darvay","year":"2003","unstructured":"Darvay, Z.: New interior-point algorithms in linear programming. Adv. Model. Optim. 5, 51\u201392 (2003)","journal-title":"Adv. Model. Optim."},{"key":"1728_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/02331934.2016.1267732","volume":"66","author":"S Asadi","year":"2017","unstructured":"Asadi, S., Mansouri, H., Darvay, Zs: An infeasible full-NT step IPM for $$P_*(\\kappa )$$ horizontal linear complementarity problem over Cartesian product of symmetric cones. Optimization 66, 225\u2013250 (2017)","journal-title":"Optimization"},{"key":"1728_CR13","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s11590-018-1328-9","volume":"13","author":"M Achache","year":"2019","unstructured":"Achache, M., Tabchouche, N.: A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems. Optim. Lett. 13, 1039\u20131057 (2019)","journal-title":"Optim. Lett."},{"key":"1728_CR14","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1080\/10556788.2018.1546857","volume":"34","author":"G Lesaja","year":"2018","unstructured":"Lesaja, G., Potra, F.A.: Adaptive full Newton-step infeasible interior-point method for sufficient horizontal LCP. Optim. Methods Softw. 34, 1014\u20131034 (2018)","journal-title":"Optim. Methods Softw."},{"key":"1728_CR15","first-page":"3","volume":"47","author":"Zs Darvay","year":"2002","unstructured":"Darvay, Zs: A weighted-path-following method for linear optimization. Stud. Univ. Babe\u015f\u2013Bolyai Inf. 47, 3\u201312 (2002)","journal-title":"Stud. Univ. Babe\u015f\u2013Bolyai Inf."},{"key":"1728_CR16","first-page":"61","volume":"49","author":"M Achache","year":"2004","unstructured":"Achache, M.: A weighted-path-following method for the linear complementarity problem. Stud. Univ. Babe\u015f\u2013Bolyai Inf. 49, 61\u201373 (2004)","journal-title":"Stud. Univ. Babe\u015f\u2013Bolyai Inf."},{"key":"1728_CR17","doi-asserted-by":"crossref","unstructured":"Kojima, M., Megiddo, N., Noma, T., Yoshise, A.: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Volume 538 of Lecture Notes in Computer Science. Springer, New York (1991)","DOI":"10.1007\/3-540-54509-3"},{"key":"1728_CR18","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, 453\u2013485 (2011)","journal-title":"Comput. Optim. Appl."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01728-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-020-01728-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01728-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,6]],"date-time":"2021-08-06T00:15:41Z","timestamp":1628208941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-020-01728-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1728"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01728-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,6]]},"assertion":[{"value":"9 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}