{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T05:52:30Z","timestamp":1781502750212,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12471355"],"award-info":[{"award-number":["12471355"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1007\/s40314-025-03528-w","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T07:40:10Z","timestamp":1766043610000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Acceleration of the modulus-based iteration methods for solving linear complementarity problems by momentum"],"prefix":"10.1007","volume":"45","author":[{"given":"Yong","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2150-1977","authenticated-orcid":false,"given":"Jian-Jun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"key":"3528_CR1","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF00935545","volume":"33","author":"BH Ahn","year":"1981","unstructured":"Ahn BH (1981) Solutions of nonsymmetric linear complementarity problems by iterative methods. J Optim Theory Appl 33:175\u2013185","journal-title":"J Optim Theory Appl"},{"key":"3528_CR2","doi-asserted-by":"publisher","first-page":"2287","DOI":"10.1137\/24M1633820","volume":"45","author":"SJ Alderman","year":"2024","unstructured":"Alderman SJ, Luikart RW, Marshall NF (2024) Randomized Kaczmarz with geometrically smoothed momentum. SIAM J Matrix Anal Appl 45:2287\u20132313","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3528_CR3","first-page":"228","volume":"5","author":"Z-Z Bai","year":"1996","unstructured":"Bai Z-Z (1996a) On the monotone convergence of the projected iteration methods for linear complementarity problem. Numer Math J Chin Univ (Engl Ser) 5:228\u2013233","journal-title":"Numer Math J Chin Univ (Engl Ser)"},{"key":"3528_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0898-1221(96)00172-1","volume":"32","author":"Z-Z Bai","year":"1996","unstructured":"Bai Z-Z (1996b) The convergence of parallel iteration algorithms for linear complementarity problems. Comput Math Appl 32:1\u201317","journal-title":"Comput Math Appl"},{"key":"3528_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0895479897324032","volume":"21","author":"Z-Z Bai","year":"1999","unstructured":"Bai Z-Z (1999) On the convergence of the multisplitting methods for the linear complementarity problem. SIAM J Matrix Anal Appl 21:67\u201378","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3528_CR6","first-page":"561","volume":"20","author":"Z-Z Bai","year":"2002","unstructured":"Bai Z-Z (2002) Experimental study of the asynchronous multisplitting relaxation methods for linear complementarity problems. J Comput Math 20:561\u2013574","journal-title":"J Comput Math"},{"key":"3528_CR7","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1002\/nla.680","volume":"6","author":"Z-Z Bai","year":"2010","unstructured":"Bai Z-Z (2010) Modulus-based matrix splitting iteration methods for linear complementarity problems. Numer Linear Algebra Appl 6:917\u2013933","journal-title":"Numer Linear Algebra Appl"},{"key":"3528_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1080\/00207169708804569","volume":"63","author":"Z-Z Bai","year":"1997","unstructured":"Bai Z-Z, Evans DJ (1997) Matrix multisplitting relaxation methods for linear complementarity problems. Int J Comput Math 63:309\u2013326","journal-title":"Int J Comput Math"},{"key":"3528_CR9","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1080\/00207169908804772","volume":"70","author":"Z-Z Bai","year":"1999","unstructured":"Bai Z-Z, Evans DJ (1999) Asynchronous multisplitting relaxation methods for linear complementarity problems. Int J Comput Math 70:519\u2013538","journal-title":"Int J Comput Math"},{"key":"3528_CR10","first-page":"125","volume":"13","author":"Z-Z Bai","year":"2001","unstructured":"Bai Z-Z, Evans DJ (2001a) Matrix multisplitting methods with applications to linear complementarity problems: parallel synchronous and chaotic methods. R\u00e9seaux et Syst\u00e9mes R\u00e9partis Calculateurs Parallel\u00e9s 13:125\u2013154","journal-title":"R\u00e9seaux et Syst\u00e9mes R\u00e9partis Calculateurs Parallel\u00e9s"},{"key":"3528_CR11","first-page":"281","volume":"19","author":"Z-Z Bai","year":"2001","unstructured":"Bai Z-Z, Evans DJ (2001b) Parallel chaotic multisplitting iterative methods for the large sparse linear complementarity problem. J Comput Math 19:281\u2013292","journal-title":"J Comput Math"},{"key":"3528_CR12","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1080\/00207160211927","volume":"79","author":"Z-Z Bai","year":"2002","unstructured":"Bai Z-Z, Evans DJ (2002a) Matrix multisplitting methods with applications to linear complementarity problems: parallel asynchronous methods. Int J Comput Math 79:205\u2013232","journal-title":"Int J Comput Math"},{"key":"3528_CR13","first-page":"97","volume":"20","author":"Z-Z Bai","year":"2002","unstructured":"Bai Z-Z, Huang Y-G (2002b) Relaxed asynchronous iterations for the linear complementarity problem. J Comput Math 20:97\u2013112","journal-title":"J Comput Math"},{"key":"3528_CR14","first-page":"773","volume":"21","author":"Z-Z Bai","year":"2003","unstructured":"Bai Z-Z, Huang Y-G (2003) A class of asynchronous parallel multisplitting relaxation methods for large sparse linear complementarity problem. J Comput Math 21:773\u2013790","journal-title":"J Comput Math"},{"key":"3528_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1002\/nla.1835","volume":"20","author":"Z-Z Bai","year":"2013","unstructured":"Bai Z-Z, Zhang L-L (2013) Modulus-based synchronous multisplitting iteration methods for linear complementarity problems. Numer Linear Algebra Appl 20:425\u2013439","journal-title":"Numer Linear Algebra Appl"},{"key":"3528_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2016.12.023","volume":"319","author":"Z-Z Bai","year":"2017","unstructured":"Bai Z-Z, Buccini A, Hayamic K, Reichel L, Yin J-F, Zheng N (2017) Modulus-based iterative methods for constrained Tikhonov regularization. J Comput Appl Math 319:1\u201313","journal-title":"J Comput Appl Math"},{"key":"3528_CR17","first-page":"1215","volume":"A273","author":"C Baiocci","year":"1971","unstructured":"Baiocci C (1971) Sur un probleme a frontiere libre traduisant le filtrage de liquides a travers des milieux proeux. C R Acad Sci Paris A273:1215\u20131217","journal-title":"C R Acad Sci Paris"},{"key":"3528_CR18","volume-title":"Dynamics of fluids in porous media","author":"J Bear","year":"1972","unstructured":"Bear J (1972) Dynamics of fluids in porous media. Elsevier, New York"},{"key":"3528_CR19","series-title":"Classics in applied mathematics","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971262","volume-title":"Nonnegative matrices in the mathematical sciences","author":"A Berman","year":"1994","unstructured":"Berman A, Plemmons RJ (1994) Nonnegative matrices in the mathematical sciences, vol 9. Classics in applied mathematics. SIAM, Philadelphia"},{"key":"3528_CR20","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF01442149","volume":"4","author":"RW Cottle","year":"1978","unstructured":"Cottle RW, Golub GH, Sacher RS (1978) On the solution of large, structured linear complementarity problems: the block partitioned case. Appl Math Optim 4:347\u2013363","journal-title":"Appl Math Optim"},{"key":"3528_CR21","volume-title":"The linear complementarity problem","author":"RW Cottle","year":"1992","unstructured":"Cottle RW, Pang J-S, Stone RE (1992) The linear complementarity problem. Academic, San Diego"},{"key":"3528_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1002\/nla.609","volume":"16","author":"J-L Dong","year":"2009","unstructured":"Dong J-L, Jiang M-Q (2009) A modified modulus method for symmetric positive-definite linear complementarity problems. Numer Linear Algebra Appl 16:129\u2013143","journal-title":"Numer Linear Algebra Appl"},{"key":"3528_CR23","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0024-3795(89)90074-8","volume":"119","author":"A Frommer","year":"1989","unstructured":"Frommer A, Mayer G (1989) Convergence of relaxed parallel multisplitting methods. Linear Algebra Appl 119:141\u2013152","journal-title":"Linear Algebra Appl"},{"key":"3528_CR24","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF01385865","volume":"63","author":"A Frommer","year":"1992","unstructured":"Frommer A, Szyld DB (1992) $$H$$-splittings and two-stage iterative methods. Numer Math 63:345\u2013356","journal-title":"Numer Math"},{"key":"3528_CR25","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.laa.2009.02.024","volume":"431","author":"A Hadjidimos","year":"2009","unstructured":"Hadjidimos A, Tzoumas M (2009) Nonstationary extrapolated modulus algorithms for the solution of the linear complementarity problem. Linear Algebra Appl 431:197\u2013210","journal-title":"Linear Algebra Appl"},{"key":"3528_CR26","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/100811222","volume":"33","author":"A Hadjidimos","year":"2011","unstructured":"Hadjidimos A, Lapidakis M, Tzoumas M (2011) On iterative solution for linear complementarity problem with an $$H_+$$-matrix. SIAM J Matrix Anal Appl 33:97\u2013110","journal-title":"SIAM J Matrix Anal Appl"},{"key":"3528_CR27","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1080\/03081087.2015.1087457","volume":"64","author":"W Li","year":"2016","unstructured":"Li W, Zheng H (2016) A preconditioned modulus-based iteration method for solving linear complementarity problems of $$H$$-matrices. Linear Multilinear Algebra 64:1390\u20131403","journal-title":"Linear Multilinear Algebra"},{"key":"3528_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01442196","volume":"13","author":"Y Lin","year":"1985","unstructured":"Lin Y, Cryer CW (1985) An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems. Appl Math Optim 13:1\u201317","journal-title":"Appl Math Optim"},{"key":"3528_CR29","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01268170","volume":"22","author":"OL Mangasarian","year":"1977","unstructured":"Mangasarian OL (1977) Solutions of symmetric linear complementarity problems by iterative methods. J Optim Theory Appl 22:465\u2013485","journal-title":"J Optim Theory Appl"},{"key":"3528_CR30","unstructured":"Murty KG (1997) Linear complementarity, linear and nonlinear programming. Internet Edition https:\/\/public.websites.umich.edu\/~murty\/books\/linear_complementarity_webbook\/"},{"key":"3528_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00934130","volume":"42","author":"J-S Pang","year":"1984","unstructured":"Pang J-S (1984) Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem. J Optim Theory Appl 42:1\u201317","journal-title":"J Optim Theory Appl"},{"key":"3528_CR32","unstructured":"van WMGB (1980) A class of linear complementarity problems is solvable in polynomial time. Unpublished Paper, Dept. of Electrical Engineering, University of Technology, The Netherlands"},{"key":"3528_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05156-2","volume-title":"Matrix iterative analysis","author":"RS Varga","year":"2000","unstructured":"Varga RS (2000) Matrix iterative analysis, Second Revised and Expanded Edition. Springer-Verlag, Berlin Heidelberg","edition":"Second Revised"},{"key":"3528_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-021-01781-6","volume":"16","author":"S-L Wu","year":"2022","unstructured":"Wu S-L, Li C-X (2022) A class of new modulus-based matrix splitting methods for linear complementarity problem. Optim Lett 16:1\u201317","journal-title":"Optim Lett"},{"key":"3528_CR35","volume-title":"Iterative solution of large linear systems","author":"DM Young","year":"1971","unstructured":"Young DM (1971) Iterative solution of large linear systems. Academic, New York"},{"key":"3528_CR36","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11075-010-9416-7","volume":"57","author":"L-L Zhang","year":"2011","unstructured":"Zhang L-L (2011) Two-step modulus based matrix splitting iteration for linear complementarity problems. Numer Algorithms 57:83\u201399","journal-title":"Numer Algorithms"},{"key":"3528_CR37","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s11075-012-9664-9","volume":"64","author":"N Zheng","year":"2013","unstructured":"Zheng N, Yin J-F (2013) Accelerated modulus-based matrix splitting iteration methods for linear complementarity problem. Numer Algorithms 64:245\u2013262","journal-title":"Numer Algorithms"},{"key":"3528_CR38","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1137\/141002220","volume":"37","author":"N Zheng","year":"2016","unstructured":"Zheng N, Hayami K, Yin J-F (2016) Modulus-type inner outer iteration methods for nonnegative constrained least squares problems. SIAM J Matrix Anal Appl 37:1250\u20131278","journal-title":"SIAM J Matrix Anal Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03528-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03528-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03528-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T05:02:37Z","timestamp":1781499757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03528-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,18]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,5]]}},"alternative-id":["3528"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03528-w","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,18]]},"assertion":[{"value":"27 August 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The authors declare that all consent required for the publication of this paper has been granted.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"135"}}