{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T07:16:51Z","timestamp":1783667811885,"version":"3.55.0"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2027,1,1]],"date-time":"2027-01-01T00:00:00Z","timestamp":1798761600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["06108057"],"award-info":[{"award-number":["06108057"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171105"],"award-info":[{"award-number":["12171105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271206"],"award-info":[{"award-number":["11271206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2027,1]]},"DOI":"10.1016\/j.cam.2026.117863","type":"journal-article","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:41:00Z","timestamp":1780382460000},"page":"117863","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A unified relaxation method for tensor split feasibility problems on unions of sets"],"prefix":"10.1016","volume":"489","author":[{"given":"Xiaopeng","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6363-7170","authenticated-orcid":false,"given":"Jinling","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117863_bib0001","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1007\/s40305-020-00337-2","article-title":"A Levenberg-Marquardt method for solving the tensor split feasibility problem","volume":"9","author":"Jin","year":"2021","journal-title":"J. Oper. Res. Soc. China"},{"key":"10.1016\/j.cam.2026.117863_bib0002","doi-asserted-by":"crossref","first-page":"20597","DOI":"10.3934\/math.20231050","article-title":"The hybird methods of projection-splitting for solving tensor split feasibility problem","volume":"8","author":"Xie","year":"2023","journal-title":"AIMS Math."},{"key":"10.1016\/j.cam.2026.117863_bib0003","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1080\/10556788.2023.2192494","article-title":"Infinite dimensional tensor variational inequalities with applications to an economic equilibrium problem","volume":"38","author":"Barbagallo","year":"2023","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117863_bib0004","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/s10957-023-02360-8","article-title":"Generalized multilinear games and vertical tensor complementarity problems","volume":"200","author":"Jia","year":"2024","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117863_bib0005","article-title":"Slice tensor splitting method for solving tensor equation","volume":"463","author":"Jiang","year":"2024","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117863_bib0006","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/BF02142692","article-title":"A multiprojection algorithm using bregman projections in a product space","volume":"8","author":"Censor","year":"1994","journal-title":"Numer. Algorithms"},{"key":"10.1016\/j.cam.2026.117863_bib0007","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1088\/0266-5611\/18\/2\/310","article-title":"Iterative oblique projection onto convex sets and the split feasibility problem","volume":"18","author":"Byrne","year":"2002","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117863_bib0008","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1088\/0266-5611\/20\/1\/006","article-title":"A unified treatment of some iterative algorithms in signal processing and image reconstruction","volume":"20","author":"Byrne","year":"2003","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117863_bib0009","doi-asserted-by":"crossref","first-page":"2353","DOI":"10.1088\/0031-9155\/51\/10\/001","article-title":"A unified approach for inversion problems in intensity-modulated radiation therapy","volume":"51","author":"Censor","year":"2006","journal-title":"Phys. Med. Biol."},{"key":"10.1016\/j.cam.2026.117863_bib0010","doi-asserted-by":"crossref","first-page":"2071","DOI":"10.1088\/0266-5611\/21\/6\/017","article-title":"The multiple-sets split feasibility problem and its applications for inverse problems","volume":"21","author":"Censor","year":"2005","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117863_bib0011","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/17415977.2012.677445","article-title":"A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem","volume":"21","author":"Li","year":"2013","journal-title":"Inverse Probl. Sci. Eng."},{"key":"10.1016\/j.cam.2026.117863_bib0012","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/s10898-018-00735-0","article-title":"A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models","volume":"73","author":"Yen","year":"2019","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.cam.2026.117863_bib0013","doi-asserted-by":"crossref","first-page":"1244","DOI":"10.1016\/j.jmaa.2006.05.010","article-title":"Perturbed projections and subgradient projections for the multiple-sets split feasibility problem","volume":"327","author":"Censor","year":"2007","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/j.cam.2026.117863_bib0014","doi-asserted-by":"crossref","DOI":"10.1016\/j.cam.2020.113291","article-title":"New iterative regularization methods for the multiple-sets split feasibility problem","volume":"388","author":"Buong","year":"2021","journal-title":"J. Comput. Appl. Math."},{"key":"10.1016\/j.cam.2026.117863_bib0015","doi-asserted-by":"crossref","first-page":"1655","DOI":"10.1088\/0266-5611\/21\/5\/009","article-title":"A note on the CQ algorithm for the split feasibility problem","volume":"21","author":"Qu","year":"2005","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117863_bib0016","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1007\/s10957-021-01910-2","article-title":"Projection algorithms for solving the split feasibility problem with multiple output sets","volume":"190","author":"Reich","year":"2021","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117863_bib0017","doi-asserted-by":"crossref","first-page":"2021","DOI":"10.1088\/0266-5611\/22\/6\/007","article-title":"A variable Krasnosel\u2019skii\u2013Mann algorithm and the multiple-set split feasibility problem","volume":"22","author":"Xu","year":"2006","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117863_bib0018","doi-asserted-by":"crossref","first-page":"1261","DOI":"10.1088\/0266-5611\/20\/4\/014","article-title":"The relaxed CQ algorithm solving the split feasibility problem","volume":"20","author":"Yang","year":"2004","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117863_bib0019","doi-asserted-by":"crossref","DOI":"10.1088\/0266-5611\/27\/3\/035009","article-title":"Self-adaptive projection methods for the multiple-sets split feasibility problem","volume":"27","author":"Zhao","year":"2011","journal-title":"Inverse Probl."},{"key":"10.1016\/j.cam.2026.117863_bib0020","series-title":"Handbook of semidefinite programming: theory, algorithms, and applications","volume":"27","author":"Wolkowicz","year":"2012"},{"key":"10.1016\/j.cam.2026.117863_bib0021","first-page":"1","article-title":"A moment-sum-of-squares hierarchy for robust polynomial matrix inequality optimization with sum-of-squares convexity","author":"Guo","year":"2024","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2026.117863_bib0022","doi-asserted-by":"crossref","first-page":"1065","DOI":"10.1287\/moor.2022.0334","article-title":"Nash equilibrium problems of polynomials","volume":"49","author":"Nie","year":"2024","journal-title":"Math. Oper. Res."},{"key":"10.1016\/j.cam.2026.117863_bib0023","doi-asserted-by":"crossref","first-page":"3477","DOI":"10.1137\/23M1615516","article-title":"Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach","volume":"34","author":"Zhong","year":"2024","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117863_bib0024","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1137\/22M1539137","article-title":"Semidefinite relaxation methods for tensor absolute value equations","volume":"44","author":"Zhou","year":"2023","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.cam.2026.117863_bib0025","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","article-title":"Global optimization with polynomials and the problem of moments","volume":"11","author":"Lasserre","year":"2001","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2026.117863_bib0026","series-title":"Moment and Polynomial Optimization","author":"Nie","year":"2023"},{"key":"10.1016\/j.cam.2026.117863_bib0027","first-page":"1","article-title":"Polynomial optimization over unions of sets","author":"Nie","year":"2024","journal-title":"Vietnam J. Math."},{"key":"10.1016\/j.cam.2026.117863_bib0028","series-title":"Moments, positive polynomials and their applications","volume":"1","author":"Lasserre","year":"2009"},{"key":"10.1016\/j.cam.2026.117863_bib0029","series-title":"An introduction to polynomial and semi-algebraic optimization","volume":"52","author":"Lasserre","year":"2015"},{"key":"10.1016\/j.cam.2026.117863_bib0030","series-title":"Emerging Applications of Algebraic Geometry","first-page":"157","article-title":"Sums of squares, moment matrices and optimization over polynomials","author":"Laurent","year":"2009"},{"key":"10.1016\/j.cam.2026.117863_bib0031","series-title":"Proceedings of the International Congress of Mathematicians","first-page":"843","article-title":"Optimization over polynomials: selected topics","author":"Laurent","year":"2014"},{"key":"10.1016\/j.cam.2026.117863_bib0032","series-title":"Semidefinite optimization and convex algebraic geometry","author":"Blekherman","year":"2012"},{"key":"10.1016\/j.cam.2026.117863_bib0033","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1090\/conm\/253\/03936","article-title":"Some concrete aspects of Hilbert\u2019s 17th problem","volume":"253","author":"Reznick","year":"2000","journal-title":"Contemp. Math."},{"key":"10.1016\/j.cam.2026.117863_bib0034","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s10208-014-9225-9","article-title":"The A-truncated K-moment problem","volume":"14","author":"Nie","year":"2014","journal-title":"Found. Comput. Math."},{"key":"10.1016\/j.cam.2026.117863_bib0035","series-title":"Positive Polynomials in Control","first-page":"293","article-title":"Detecting global optimality and extracting solutions in gloptipoly","author":"Henrion","year":"2005"},{"key":"10.1016\/j.cam.2026.117863_bib0036","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-008-0240-y","article-title":"Semidefinite representation of convex sets","volume":"122","author":"Helton","year":"2010","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117863_bib0037","doi-asserted-by":"crossref","first-page":"969","DOI":"10.1512\/iumj.1993.42.42045","article-title":"Positive polynomials on compact semi-algebraic sets","volume":"42","author":"Putinar","year":"1993","journal-title":"Ind. Univ. Math. J."},{"key":"10.1016\/j.cam.2026.117863_bib0038","series-title":"Real algebraic geometry","volume":"36","author":"Bochnak","year":"2013"},{"key":"10.1016\/j.cam.2026.117863_bib0039","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/s10107-012-0589-9","article-title":"Certifying convergence of Lasserre\u2019s hierarchy via flat truncation","volume":"142","author":"Nie","year":"2013","journal-title":"Math. Program."},{"key":"10.1016\/j.cam.2026.117863_bib0040","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/10556780802699201","article-title":"Gloptipoly 3: moments, optimization and semidefinite programming","volume":"24","author":"Henrion","year":"2009","journal-title":"Optim. Methods Softw."},{"key":"10.1016\/j.cam.2026.117863_sbref0041","article-title":"Addendum to the SeDuMi user guide version 1.1","author":"Polik","year":"2005","journal-title":"Ref. Guide"},{"key":"10.1016\/j.cam.2026.117863_bib0042","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","article-title":"Using SEDUMI 1.02. A matlab toolbox for optimization over symmetric cones","volume":"11","author":"Strum","year":"1999","journal-title":"Optimization Methods and Software"}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726005054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726005054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T06:48:58Z","timestamp":1783666138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726005054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2027,1]]},"references-count":42,"alternative-id":["S0377042726005054"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117863","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2027,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A unified relaxation method for tensor split feasibility problems on unions of sets","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117863","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117863"}}