{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:37Z","timestamp":1740169117167,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100009012","name":"Hohai University","doi-asserted-by":"publisher","award":["2018M632222"],"award-info":[{"award-number":["2018M632222"]}],"id":[{"id":"10.13039\/501100009012","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2930562","type":"journal-article","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T20:32:06Z","timestamp":1563913926000},"page":"100143-100146","source":"Crossref","is-referenced-by-count":3,"title":["A new Approach for the Modulus-Based Matrix Splitting Algorithms"],"prefix":"10.1109","volume":"7","author":[{"given":"Wenpeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9349-5695","authenticated-orcid":false,"given":"S. A.","family":"Edalatpanah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8734-5436","authenticated-orcid":false,"given":"S. E.","family":"Najafi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/00207168608803522"},{"article-title":"A class of linear complementarity problems is solvable in polynomial time","year":"1980","author":"van bokhoven","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-016-0243-3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/nla.680"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.11648\/j.acm.20150401.14"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10092-018-0279-y"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-013-0362-0"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897324032"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2991\/mmsa-18.2018.72"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1002\/nla.609"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2004.06.010"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10092-015-0143-2"},{"journal-title":"Nonlinear Programming Theory and Algorithms","year":"2013","author":"bazaraa","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-9644-0.ch021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56886-2"},{"key":"ref8","article-title":"On the preconditioned projective iterative methods for the linear complementarity problem","author":"edalatpanah","year":"2018","journal-title":"RAIRO - Operations Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0135-1"},{"journal-title":"The Linear Complementarity Problem","year":"1992","author":"cottle","key":"ref2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2920485"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971262","author":"berman","year":"1994","journal-title":"Nonnegative Matrices in Dynamic Systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2010.12.005"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2019.02.015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/2013027"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CINC.2009.158"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1186\/s13660-018-1789-5"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2018.1470602"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2009.02.024"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08769837.pdf?arnumber=8769837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,24]],"date-time":"2022-09-24T12:22:42Z","timestamp":1664022162000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8769837\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2930562","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}