{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:22:56Z","timestamp":1787336576914,"version":"build-2736575974"},"reference-count":32,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11271289"],"award-info":[{"award-number":["11271289"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The Grant-in-Aid for Scientific Research of the Ministry of Education, Culture, Sports, Science and Technology, Japan"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Matrix Anal. Appl."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>For the solution of large sparse nonnegative constrained linear least squares (NNLS) problems, a new iterative method is proposed which uses the CGLS method for the inner iterations and the modulus iterative method for the outer iterations to solve the linear complementarity problem resulting from the Karush--Kuhn--Tucker conditions of the NNLS problem. Theoretical convergence analysis including the optimal choice of the parameter matrix is presented for the proposed method. In addition, the method can be further enhanced by incorporating the active set strategy, which contains two stages; the first stage consists of modulus iterations to identify the active set, while the second stage solves the reduced unconstrained least squares problems only on the inactive variables, and projects the solution into the nonnegative region. Numerical experiments show the efficiency of the proposed methods compared to projection gradient--type methods with fewer iteration steps and less CPU time.<\/jats:p>","DOI":"10.1137\/141002220","type":"journal-article","created":{"date-parts":[[2016,9,21]],"date-time":"2016-09-21T15:27:56Z","timestamp":1474471676000},"page":"1250-1278","source":"Crossref","is-referenced-by-count":36,"title":["Modulus-Type Inner Outer Iteration Methods for Nonnegative Constrained Least Squares Problems"],"prefix":"10.1137","volume":"37","author":[{"given":"Ning","family":"Zheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ken","family":"Hayami","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun-Feng","family":"Yin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/nla.680"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479801395458"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1976.1101194"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"\\AA. Bj\u00f6rck,\n                      Numerical Methods for Least Squares Problems\n                      , SIAM, Philadelphia, 1996, http:\/\/dx.doi.org\/10.1137\/1.9781611971484.","DOI":"10.1137\/1.9781611971484"},{"key":"atypb5","first-page":"193","author":"Berisha S.","year":"2013","journal-title":"UK"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(91)90009-L"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502410451"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/0309028"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/20\/6\/003"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592073"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"atypb12","unstructured":"R. S. Dembo and U. Tulowitzki,\n                      On the Minimization of Quadratic Functions Subject to Box Constraints\n                      , working paper 71, School of Organization and Management, Yale University, New Haven, CT, 1983."},{"key":"atypb13","doi-asserted-by":"crossref","unstructured":"A. Greenbaum,\n                      Iterative Methods for Solving Linear Systems\n                      , Frontiers Appl. Math. 17, SIAM, Philadelphia, 1997, http:\/\/dx.doi.org\/10.1137\/1.9781611970937 doi:10.1137\/1.9781611970937.","DOI":"10.1137\/1.9781611970937"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02149761"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(00)00116-6"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1137\/070696313"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/0020-7225(86)90015-7"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050050"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01937487"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/110828472"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/s10092-010-0030-9"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2005.06.053"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396045"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1137\/0801008"},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"J. G. Nagy and Z. Strako\u0161,\n                      Enforcing nonnegativity in image reconstruction algorithms\n                      , in Mathematical Modeling, Estimation, and Imaging, Proc. SPIE 4121, D. C. Wilson, H. D. Tagare, F. L. Bookstein, F. J. Preteux, and E. R. Dougherty, eds., The International Society for Optical Engineering, Bellingham, WA, 2000, pp. 182-190, http:\/\/dx.doi.org\/10.1117\/12.402439 doi:10.1117\/12.402439.","DOI":"10.1117\/12.402439"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(80)90173-1"},{"key":"atypb27","doi-asserted-by":"crossref","unstructured":"J. M. Ortega and W. C. Rheinboldt,\n                      Iterative Solution of Nonlinear Equations in Several Variables\n                      , SIAM, Philadelphia, 2000, http:\/\/dx.doi.org\/10.1137\/1.9780898719468 doi:10.1137\/1.9780898719468.","DOI":"10.1137\/1.9780898719468"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(69)90035-4"},{"key":"atypb29","doi-asserted-by":"crossref","unstructured":"Y. Saad,\n                      Iterative Methods for Sparse Linear Systems\n                      , 2nd ed., SIAM, Philadelphia, 2003, http:\/\/dx.doi.org\/10.1137\/1.9780898718003 doi:10.1137\/1.9780898718003.","DOI":"10.1137\/1.9780898718003"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/BF00939565"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1007\/BF01586934"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-012-9664-9"}],"container-title":["SIAM Journal on Matrix Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/141002220","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:22:49Z","timestamp":1787332969000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/141002220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":32,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1137\/141002220"],"URL":"https:\/\/doi.org\/10.1137\/141002220","relation":{},"ISSN":["0895-4798","1095-7162"],"issn-type":[{"value":"0895-4798","type":"print"},{"value":"1095-7162","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}