{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:56:29Z","timestamp":1740110189991,"version":"3.37.3"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"name":"Fundamental Research Funds for the Central Universities"},{"DOI":"10.13039\/501100008536","name":"Lanzhou University of Technology, China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008536","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61877046","41471338"],"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":[[2019,9]]},"DOI":"10.1016\/j.cam.2019.02.028","type":"journal-article","created":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T16:51:54Z","timestamp":1551804714000},"page":"251-272","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":28,"special_numbering":"C","title":["A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming"],"prefix":"10.1016","volume":"357","author":[{"given":"Xiaokai","family":"Chang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3625-3398","authenticated-orcid":false,"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Pengjun","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Dunjiang","family":"Song","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2019.02.028_b1","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1137\/140964357","article-title":"A convergent 3-block semi-proximal alternating direction method of multipliers for conic programming with 4-type of constraints","volume":"25","author":"Sun","year":"2015","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2019.02.028_b2","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.neucom.2016.06.043","article-title":"Modified alternating direction method of multipliers for convex quadratic semidefinite programming","volume":"214","author":"Chang","year":"2016","journal-title":"Neurocomputing"},{"issue":"10","key":"10.1016\/j.cam.2019.02.028_b3","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1080\/02331934.2018.1490956","article-title":"A note on the sufficient initial condition ensuring the convergence of directly extended 3-block ADMM for special semidefinite programming","volume":"67","author":"Chang","year":"2018","journal-title":"Optimization"},{"key":"10.1016\/j.cam.2019.02.028_b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1970392.1970395","article-title":"Robust principal component analysis?","volume":"58","author":"Cand\u2019es","year":"2011","journal-title":"J. ACM"},{"year":"2016","series-title":"Handbook on Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing","author":"Bouwmans","key":"10.1016\/j.cam.2019.02.028_b5"},{"key":"10.1016\/j.cam.2019.02.028_b6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/j.sigpro.2015.11.002","article-title":"Alternating strategies with internal ADMM for low-rank matrix reconstruction","volume":"121","author":"Li","year":"2016","journal-title":"Signal Process."},{"key":"10.1016\/j.cam.2019.02.028_b7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/100781894","article-title":"Recovering low-rank and sparse components of matrices from incomplete and noisy observations","volume":"21","author":"Tao","year":"2011","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2019.02.028_b8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1137\/110822347","article-title":"Alternating direction method with Gaussian back substitution for separable convex programming","volume":"22","author":"He","year":"2012","journal-title":"SIAM J. Optim."},{"issue":"3","key":"10.1016\/j.cam.2019.02.028_b9","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1007\/s10589-018-9994-1","article-title":"A class of ADMM-based algorithms for multi-block separable convex programming","volume":"70","author":"He","year":"2018","journal-title":"Comput. Optim. Appl."},{"year":"1978","series-title":"Finite Element Approximation and Iterative Solution of a Class of Mildly Nonlinear Elliptic Equations","author":"Chan","key":"10.1016\/j.cam.2019.02.028_b10"},{"key":"10.1016\/j.cam.2019.02.028_b11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","article-title":"A dual algorithm for the solution of nonlinear variational problems via finite element approximation","volume":"2","author":"Gabay","year":"1976","journal-title":"Comput. Math. Appl."},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b12","first-page":"3836","article-title":"Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems","volume":"26","author":"Hong","year":"2014","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2019.02.028_b13","series-title":"Splitting Methods in Communication, Imaging, Science, and Engineering","first-page":"251","article-title":"ADMM and non-convex variational problems","author":"Glowinski","year":"2016"},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10915-018-0757-z","article-title":"Global convergence of ADMM in nonconvex nonsmooth optimization","volume":"78","author":"Wang","year":"2019","journal-title":"J. Sci. Comput."},{"issue":"12","key":"10.1016\/j.cam.2019.02.028_b15","doi-asserted-by":"crossref","DOI":"10.1007\/s11432-017-9367-6","article-title":"Convergence of multi-block Bregman ADMM for nonconvex composite problems","volume":"61","author":"Wang","year":"2018","journal-title":"Sci. China Inf. Sci."},{"issue":"4","key":"10.1016\/j.cam.2019.02.028_b16","doi-asserted-by":"crossref","first-page":"1549","DOI":"10.1137\/16M1078604","article-title":"Convergence analysis of Douglas\u2013Rachford splitting method for \u201cstrongly\u00a0\uff0b\u00a0weakly\u201d convex programming","volume":"55","author":"Guo","year":"2017","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b17","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/s10957-017-1207-z","article-title":"Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization","volume":"176","author":"Gao","year":"2018","journal-title":"J. Optim. Theory Appl."},{"year":"2016","series-title":"Linearized Alternating Direction Method of Multipliers Via Positive-Indefinite Proximal Regularization for Convex Programming","author":"He","key":"10.1016\/j.cam.2019.02.028_b18"},{"issue":"5","key":"10.1016\/j.cam.2019.02.028_b19","doi-asserted-by":"crossref","first-page":"A2792","DOI":"10.1137\/110833543","article-title":"The linearized alternating direction method of multipliers for dantzig selector","volume":"34","author":"Wang","year":"2012","journal-title":"SIAM J. Sci. Comput."},{"year":"2017","series-title":"Optimal Linearized Alternating Direction Method of Multipliers for Convex Programming","author":"He","key":"10.1016\/j.cam.2019.02.028_b20"},{"issue":"281","key":"10.1016\/j.cam.2019.02.028_b21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","article-title":"Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization","volume":"82","author":"Yang","year":"2013","journal-title":"Math. Comp."},{"issue":"3","key":"10.1016\/j.cam.2019.02.028_b22","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s10915-015-0048-x","article-title":"On the global and linear convergence of the generalized alternating direction method of multipliers","volume":"66","author":"Deng","year":"2016","journal-title":"J. Sci. Comput."},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s13660-017-1295-1","article-title":"The convergence rate of the proximal alternating direction method of multipliers with indefinite proximal regularization","volume":"2017","author":"Sun","year":"2017","journal-title":"J. Inequal. Appl."},{"key":"10.1016\/j.cam.2019.02.028_b24","unstructured":"M.L.N. Goncalves, J.G. Melo, R.D.C. Monteiro, Extending the ergodic convergence rate of the proximal ADMM, 2016, arXiv:161102903."},{"issue":"2","key":"10.1016\/j.cam.2019.02.028_b25","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1137\/140999025","article-title":"A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization","volume":"26","author":"Li","year":"2016","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.cam.2019.02.028_b26","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01581204","article-title":"On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators","volume":"55","author":"Eckstein","year":"1992","journal-title":"Math. Program."},{"issue":"10","key":"10.1016\/j.cam.2019.02.028_b27","doi-asserted-by":"crossref","first-page":"2179","DOI":"10.1007\/s11425-013-4683-0","article-title":"A proximal point algorithm revisit on alternating direction method of multipliers","volume":"56","author":"Cai","year":"2013","journal-title":"Sci. China Math."},{"key":"10.1016\/j.cam.2019.02.028_b28","doi-asserted-by":"crossref","first-page":"1467","DOI":"10.1137\/15M1044448","article-title":"Convergence study on the symmetric version of ADMM with larger step sizes","volume":"9","author":"He","year":"2016","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b29","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10589-017-9971-0","article-title":"Generalized symmetric ADMM for separable convex programming","volume":"70","author":"Bai","year":"2018","journal-title":"Comput. Optim. Appl."},{"year":"1970","series-title":"Convex Analysis","author":"Rockafellar","key":"10.1016\/j.cam.2019.02.028_b30"},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"Boyd","year":"2011","journal-title":"Found. Trends Mach. Learn."},{"issue":"3","key":"10.1016\/j.cam.2019.02.028_b32","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1111\/j.1467-9868.2011.00771.x","article-title":"Regression shrinkage and selection via the lasso: a retrospective","volume":"73","author":"Tibshirani","year":"2011","journal-title":"J. R. Stat. Soc. Ser. B Stat. Methodol."},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b33","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/s10851-014-0510-7","article-title":"A partial splitting augmented Lagrangian method for low patch-rank image decomposition","volume":"51","author":"Han","year":"2015","journal-title":"J. Math. Imaging Vision"},{"issue":"1","key":"10.1016\/j.cam.2019.02.028_b34","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/110854989","article-title":"A low patch-rank interpretation of texture","volume":"6","author":"Schaeffer","year":"2013","journal-title":"SIAM J. Imaging Sci."},{"key":"10.1016\/j.cam.2019.02.028_b35","doi-asserted-by":"crossref","first-page":"2233","DOI":"10.1109\/TIP.2013.2246520","article-title":"A coupled variational image decomposition and restoration model for blurred cartoon-plus-texture images with missing pixels","volume":"22","author":"Ng","year":"2013","journal-title":"IEEE Tran. Imaging Proc."},{"issue":"11","key":"10.1016\/j.cam.2019.02.028_b36","doi-asserted-by":"crossref","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","article-title":"Fast solution of l1-norm minimization problems when the solution may be sparse","volume":"54","author":"Donoho","year":"2008","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.cam.2019.02.028_b37","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/j.cam.2017.11.033","article-title":"Convergent prediction-ccorrection-based ADMM for multi-block separable convex programming","volume":"335","author":"Chang","year":"2018","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.cam.2019.02.028_b38","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/s10915-015-0150-0","article-title":"Alternating proximal gradient method for convex minimization","volume":"68","author":"Ma","year":"2016","journal-title":"J. Sci. Comput."},{"issue":"303","key":"10.1016\/j.cam.2019.02.028_b39","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1090\/mcom\/3104","article-title":"A sequential updating scheme of the Lagrange multiplier for separable convex programming","volume":"86","author":"Dai","year":"2017","journal-title":"Math. Comp."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042719301013?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042719301013?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T20:59:03Z","timestamp":1712437143000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042719301013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":39,"alternative-id":["S0377042719301013"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2019.02.028","relation":{},"ISSN":["0377-0427"],"issn-type":[{"type":"print","value":"0377-0427"}],"subject":[],"published":{"date-parts":[[2019,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A generalization of linearized alternating direction method of multipliers for solving two-block separable convex programming","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.2019.02.028","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2019 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}