{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T11:17:34Z","timestamp":1781003854861,"version":"3.54.1"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004500","name":"Chongqing Technology and Business University","doi-asserted-by":"publisher","award":["ZDPTTD201908"],"award-info":[{"award-number":["ZDPTTD201908"]}],"id":[{"id":"10.13039\/501100004500","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004500","name":"Chongqing Technology and Business University","doi-asserted-by":"publisher","award":["KFJJ2022055"],"award-info":[{"award-number":["KFJJ2022055"]}],"id":[{"id":"10.13039\/501100004500","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005230","name":"Natural Science Foundation of Chongqing Municipality","doi-asserted-by":"publisher","award":["CSTB2024NSCQ-MSX1282"],"award-info":[{"award-number":["CSTB2024NSCQ-MSX1282"]}],"id":[{"id":"10.13039\/501100005230","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Communications in Nonlinear Science and Numerical Simulation"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.cnsns.2025.109480","type":"journal-article","created":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T16:58:22Z","timestamp":1762361902000},"page":"109480","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["An accelerated preconditioned primal-dual gradient algorithm for structured nonconvex optimization problems"],"prefix":"10.1016","volume":"153","author":[{"given":"Xian-Jun","family":"Long","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jia-Lin","family":"Nie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhun","family":"Gou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang-Kai","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gao-Xi","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.cnsns.2025.109480_bib0001","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/MSP.2018.2877582","article-title":"Nonnegative matrix factorization for signal and data analytics: identifiability, algorithms, and applications","volume":"36","author":"Fu","year":"2019","journal-title":"IEEE Signal Process Mag"},{"issue":"1","key":"10.1016\/j.cnsns.2025.109480_bib0002","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","article-title":"Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods","volume":"137","author":"Attouch","year":"2013","journal-title":"Math Program"},{"issue":"4","key":"10.1016\/j.cnsns.2025.109480_bib0003","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","article-title":"Compressed sensing","volume":"52","author":"Donoho","year":"2006","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"10.1016\/j.cnsns.2025.109480_bib0004","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1287\/moor.1100.0449","article-title":"Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kurdyka-\u0141ojasiewicz inequality","volume":"35","author":"Attouch","year":"2010","journal-title":"Math Oper Res"},{"issue":"3","key":"10.1016\/j.cnsns.2025.109480_bib0005","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s12532-018-0153-6","article-title":"Certifiably optimal sparse principal component analysis","volume":"11","author":"Berk","year":"2019","journal-title":"Math Program Comput"},{"issue":"1","key":"10.1016\/j.cnsns.2025.109480_bib0006","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","volume":"146","author":"Bolte","year":"2014","journal-title":"Math Program"},{"issue":"3","key":"10.1016\/j.cnsns.2025.109480_bib0007","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1109\/TCBB.2017.2756628","article-title":"Clustering and integrating of heterogeneous microbiome data by joint symmetric nonnegative matrix factorization with Laplacian regularization","volume":"17","author":"Ma","year":"2017","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"10.1016\/j.cnsns.2025.109480_bib0008","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/s10851-015-0565-0","article-title":"iPiasco: inertial proximal algorithm for strongly convex optimization","volume":"53","author":"Ochs","year":"2015","journal-title":"J Math Imag Vision"},{"issue":"2","key":"10.1016\/j.cnsns.2025.109480_bib0009","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1137\/130942954","article-title":"IPiano: inertial proximal algorithm for nonconvex optimization","volume":"7","author":"Ochs","year":"2014","journal-title":"SIAM J Imag Sci"},{"issue":"2","key":"10.1016\/j.cnsns.2025.109480_bib0010","doi-asserted-by":"crossref","first-page":"856","DOI":"10.1137\/16M1107863","article-title":"Ng orthogonal nonnegative matrix factorization by sparsity and nuclear norm optimization","volume":"39","author":"Pan","year":"2018","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"3","key":"10.1016\/j.cnsns.2025.109480_bib0011","doi-asserted-by":"crossref","first-page":"1798","DOI":"10.1137\/14098435X","article-title":"A weighted difference of anisotropic and isotropic total variation model for image processing","volume":"8","author":"Lou","year":"2015","journal-title":"SIAM J Imag Sci"},{"issue":"1","key":"10.1016\/j.cnsns.2025.109480_bib0012","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1137\/140952363","article-title":"Minimization of l_1\u22122 for compressed sensing","volume":"37","author":"Yin","year":"2015","journal-title":"SIAM J Sci Comput"},{"key":"10.1016\/j.cnsns.2025.109480_bib0013","first-page":"5160","article-title":"Dropping symmetry for fast symmetric nonnegative matrix factorization","volume":"31","author":"Zhu","year":"2018","journal-title":"Adv Neural Inf Process Syst"},{"issue":"4","key":"10.1016\/j.cnsns.2025.109480_bib0014","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1137\/16M1064064","article-title":"Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems","volume":"9","author":"Pock","year":"2016","journal-title":"SIAM J Imag Sci"},{"key":"10.1016\/j.cnsns.2025.109480_bib0015","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1007\/s10898-019-00819-5","article-title":"A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems","volume":"76","author":"Gao","year":"2020","journal-title":"J Global Optim"},{"key":"10.1016\/j.cnsns.2025.109480_bib0016","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.apnum.2023.03.014","article-title":"A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems","volume":"189","author":"Wang","year":"2023","journal-title":"Appl Numer Math"},{"issue":"2","key":"10.1016\/j.cnsns.2025.109480_bib0017","doi-asserted-by":"crossref","first-page":"1300","DOI":"10.1137\/18M1190689","article-title":"A proximal minimization algorithm for structured nonconvex and nonsmooth problems","volume":"29","author":"Bot","year":"2019","journal-title":"SIAM J Optim"},{"key":"10.1016\/j.cnsns.2025.109480_bib0018","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.apnum.2024.05.006","article-title":"A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems","volume":"202","author":"Long","year":"2024","journal-title":"Appl Numer Math"},{"key":"10.1016\/j.cnsns.2025.109480_bib0019","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.ejor.2025.04.034","article-title":"A proximal splitting algorithm for generalized DC programming with applications in signal recovery","volume":"326","author":"Pham","year":"2025","journal-title":"Eur J Oper Res"},{"issue":"2","key":"10.1016\/j.cnsns.2025.109480_bib0020","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s10589-022-00364-0","article-title":"Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems","volume":"82","author":"Wang","year":"2022","journal-title":"Comput Optim Appl"},{"issue":"3","key":"10.1016\/j.cnsns.2025.109480_bib0021","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1007\/s10898-020-00943-7","article-title":"Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems","volume":"79","author":"Wu","year":"2021","journal-title":"J Global Optim"},{"key":"10.1016\/j.cnsns.2025.109480_bib0022","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1007\/s10898-022-01176-6","article-title":"Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems","volume":"84","author":"Zhao","year":"2022","journal-title":"J Global Optim"},{"key":"10.1016\/j.cnsns.2025.109480_bib0023","series-title":"First-order methods in optimization","author":"Beck","year":"2017"},{"key":"10.1016\/j.cnsns.2025.109480_bib0024","volume":"vol. 317","author":"Rockafellar","year":"1998"},{"key":"10.1016\/j.cnsns.2025.109480_bib0025","series-title":"Convex analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/j.cnsns.2025.109480_bib0026","series-title":"Convex analysis and monotone operator theory in hilbert spaces","author":"Bauschke","year":"2017"},{"key":"10.1016\/j.cnsns.2025.109480_bib0027","series-title":"Perturbation analysis of optimization problems","author":"Bonnans","year":"2013"},{"key":"10.1016\/j.cnsns.2025.109480_bib0028","series-title":"2011 International conference on computer vision","first-page":"1762","article-title":"Diagonal preconditioning for first order primal-dual algorithms in convex optimization","author":"Pock","year":"2011"},{"issue":"4","key":"10.1016\/j.cnsns.2025.109480_bib0029","doi-asserted-by":"crossref","first-page":"1210","DOI":"10.1287\/moor.2017.0900","article-title":"Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence","volume":"43","author":"Bolte","year":"2018","journal-title":"Math Oper Res"},{"issue":"2","key":"10.1016\/j.cnsns.2025.109480_bib0030","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1137\/S0363012998338806","article-title":"A modified forward-backward splitting method for maximal monotone mappings","volume":"38","author":"Tseng","year":"2000","journal-title":"SIAM J Control Optim"},{"key":"10.1016\/j.cnsns.2025.109480_bib0031","series-title":"Proceedings of 1994 IEEE workshop on applications of computer vision","article-title":"Parameterisation of a stochastic model for human face identification","author":"Samaria","year":"1994"}],"container-title":["Communications in Nonlinear Science and Numerical Simulation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1007570425008895?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1007570425008895?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T02:34:05Z","timestamp":1780972445000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1007570425008895"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":31,"alternative-id":["S1007570425008895"],"URL":"https:\/\/doi.org\/10.1016\/j.cnsns.2025.109480","relation":{},"ISSN":["1007-5704"],"issn-type":[{"value":"1007-5704","type":"print"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An accelerated preconditioned primal-dual gradient algorithm for structured nonconvex optimization problems","name":"articletitle","label":"Article Title"},{"value":"Communications in Nonlinear Science and Numerical Simulation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cnsns.2025.109480","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 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":"109480"}}