{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T14:57:14Z","timestamp":1773413834522,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T00:00:00Z","timestamp":1570492800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61877046"],"award-info":[{"award-number":["61877046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s40314-019-0949-7","type":"journal-article","created":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T18:09:31Z","timestamp":1570558171000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An indefinite proximal Peaceman\u2013Rachford splitting method with substitution procedure for convex programming"],"prefix":"10.1007","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7268-9260","authenticated-orcid":false,"given":"Zhao","family":"Deng","sequence":"first","affiliation":[]},{"given":"Sanyang","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,8]]},"reference":[{"issue":"1\u20132","key":"949_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1023\/A:1011253113155","volume":"9","author":"F Alvarez","year":"2001","unstructured":"Alvarez F, Attouch H (2001) An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping. Set Valued Anal 9(1\u20132):3\u201311","journal-title":"Set Valued Anal"},{"issue":"1","key":"949_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10589-017-9971-0","volume":"70","author":"J Bai","year":"2018","unstructured":"Bai J, Li J, Xu F, Zhang H (2018) Generalized symmetric admm for separable convex optimization. Comput Optim Appl 70(1):129\u2013170","journal-title":"Comput Optim Appl"},{"issue":"1","key":"949_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J Imaging Sci 2(1):183\u2013202","journal-title":"SIAM J Imaging Sci"},{"issue":"1","key":"949_CR4","first-page":"1","volume":"3","author":"SP Boyd","year":"2011","unstructured":"Boyd SP, Parikh N, Chu E, Peleato B, Eckstein J (2011) Distributed optimization and statistical learning via the alternating direction method of multipliers. Found Trends Mach Learn Arch 3(1):1\u2013122","journal-title":"Found Trends Mach Learn Arch"},{"issue":"3","key":"949_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1970392.1970395","volume":"58","author":"EJ Cand\u2019es","year":"2011","unstructured":"Cand\u2019es EJ, Li X, Ma Y, Wright J (2011) Robust principal component analysis. J ACM 58(3):1\u201337","journal-title":"J ACM"},{"issue":"1","key":"949_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/02331934.2016.1246547","volume":"66","author":"X Chang","year":"2016","unstructured":"Chang X, Liu S (2016) A 2-block semi-proximal admm for solving the H-weighted nearest correlation matrix problem. Optimization 66(1):1\u201316","journal-title":"Optimization"},{"key":"949_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.cam.2017.11.033","volume":"335","author":"X Chang","year":"2017","unstructured":"Chang X, Liu S, Zhao P, Li X (2017) Convergent prediction\u2013correction-based admm for multi-block separable convex programming. J Comput Appl Math 335:270\u2013288","journal-title":"J Comput Appl Math"},{"key":"949_CR8","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1137\/15100463X","volume":"8","author":"C Chen","year":"2015","unstructured":"Chen C, Chan RH, Ma S, Yang J (2015) Inertial proximal admm for linearly constrained separable convex optimization. SIAM J Imaging Sci 8:2239\u20132267","journal-title":"SIAM J Imaging Sci"},{"issue":"1","key":"949_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-016-1007-5","volume":"161","author":"L Chen","year":"2017","unstructured":"Chen L, Sun D, Toh KC (2017) An efficient inexact symmetric Gauss-seidel based majorized admm for high-dimensional convex composite conic programming. Math Program 161(1):237\u2013270","journal-title":"Math Program"},{"key":"949_CR10","unstructured":"Combettes PL, Pesquet JC (2011) Proximal splitting methods in signal processing. In: Fixed-point algorithms for inverse problems in science and engineering, pp 185\u2013212"},{"issue":"4","key":"949_CR11","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1137\/130940402","volume":"24","author":"E Corman","year":"2014","unstructured":"Corman E, Yuan X (2014) A generalized proximal point algorithm and its convergence rate. SIAM J Optim 24(4):1614\u20131638","journal-title":"SIAM J Optim"},{"issue":"2","key":"949_CR12","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/s10915-016-0318-2","volume":"71","author":"W Deng","year":"2017","unstructured":"Deng W, Lai MJ, Peng Z, Yin W (2017) Parallel multi-block admm with $$o(1\/k)$$ convergence. J Sci Comput 71(2):712\u2013736","journal-title":"J Sci Comput"},{"issue":"11","key":"949_CR13","doi-asserted-by":"publisher","first-page":"4789","DOI":"10.1109\/TIT.2008.929958","volume":"54","author":"DL Donoho","year":"2008","unstructured":"Donoho DL, Tsaig Y (2008) Fast solution of $$l_1$$-norm minimization problems when the solution may be sparse. IEEE Trans Inf Theory 54(11):4789\u20134812","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"949_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1360\/N012016-00134","volume":"47","author":"M Dou","year":"2017","unstructured":"Dou M, Li H, Liu X (2017) An inertial proximal Peaceman\u2013Rachford splitting method. Sci Sin 47(2):333\u2013348","journal-title":"Sci Sin"},{"key":"949_CR15","volume-title":"Finite-dimensional variational inequalities and complementarity problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei F, Pang J (2003) Finite-dimensional variational inequalities and complementarity problems. Springer, New York [2(1)]"},{"key":"949_CR16","unstructured":"Fu X, He B, Wang X, Yuan X (2014) Block-wise alternating direction method of multipliers with Gaussian back substitution for multiple-block convex programming. \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2014\/09\/4544.pdf"},{"key":"949_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0168-2024(08)70034-1","volume":"15","author":"D Gabay","year":"1983","unstructured":"Gabay D (1983) Chapter IX Applications of the method of multipliers to variational inequalities. Stud Math Appl 15:299\u2013331","journal-title":"Stud Math Appl"},{"issue":"1","key":"949_CR18","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/s10957-017-1207-z","volume":"176","author":"B Gao","year":"2018","unstructured":"Gao B, Ma F (2018) Symmetric alternating direction method with indefinite proximal regularization for linearly constrained convex optimization. J Optim Theory Appl 176(1):178\u2013204","journal-title":"J Optim Theory Appl"},{"key":"949_CR19","unstructured":"Gu Y, Jiang B, Han D (2015) A semi-proximal-based strictly contractive Peaceman\u2013Rachford splitting method. arXiv preprint \n                    arXiv:1506.02221"},{"issue":"2","key":"949_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10589-012-9510-y","volume":"54","author":"D Han","year":"2013","unstructured":"Han D, Yuan X, Zhang W, Cai X (2013) An ADM-based splitting method for separable convex programming. Comput Optim Appl 54(2):343\u2013369","journal-title":"Comput Optim Appl"},{"issue":"4","key":"949_CR21","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s40305-015-0108-9","volume":"3","author":"B He","year":"2015","unstructured":"He B (2015) PPA-like contraction methods for convex optimization: a framework using variational inequality approach. J Oper Res Soc China 3(4):391\u2013420","journal-title":"J Oper Res Soc China"},{"issue":"2","key":"949_CR22","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/110836936","volume":"50","author":"B He","year":"2012","unstructured":"He B, Yuan X (2012) On the $$o(1\/n)$$ convergence rate of the Douglas\u2013Rachford alternating direction method. SIAM J Numer Anal 50(2):700\u2013709","journal-title":"SIAM J Numer Anal"},{"issue":"3","key":"949_CR23","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s00211-014-0673-6","volume":"130","author":"B He","year":"2015","unstructured":"He B, Yuan X (2015) On non-Ergodic convergence rate of Douglas\u2013Rachford alternating direction method of multipliers. Numerische Mathematik 130(3):567\u2013577","journal-title":"Numerische Mathematik"},{"issue":"2","key":"949_CR24","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He B, Tao M, Yuan X (2012) Alternating direction method with Gaussian back substitution for separalbe convex programming. SIAM J Optim 22(2):313\u2013340","journal-title":"SIAM J Optim"},{"issue":"3","key":"949_CR25","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1137\/13090849X","volume":"24","author":"B He","year":"2014","unstructured":"He B, Liu H, Wang Z, Yuan X (2014) A strictly contractive Peaceman\u2013Rachford splitting method for convex programming. SIAM J Optim 24(3):1011\u20131040","journal-title":"SIAM J Optim"},{"issue":"3","key":"949_CR26","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/15M1044448","volume":"9","author":"B He","year":"2016","unstructured":"He B, Ma F, Yuan X (2016) Convergence study on the symmetric version of ADMM with larger step sizes. SIAM J Imaging Sci 9(3):1467\u20131501","journal-title":"SIAM J Imaging Sci"},{"key":"949_CR27","unstructured":"He B, Ma F, Yuan X (2017) Optimal linearized alternating direction method of multipliers for convex programming. \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2017\/09\/6228.pdf"},{"key":"949_CR28","doi-asserted-by":"publisher","unstructured":"Jiang F, Wu Z, Cai X (2018) Generalized ADMM with optimal indefinite proximal term for linearly constrained convex optimization. J Ind Manag Optim. \n                    https:\/\/doi.org\/10.3934\/jimo.2018181","DOI":"10.3934\/jimo.2018181"},{"issue":"6","key":"949_CR29","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions PL, Mercier B (1979) Splitting algorithms for the sum of two nonlinear operators. SIAM J Numer Anal 16(6):964\u2013979","journal-title":"SIAM J Numer Anal"},{"issue":"1","key":"949_CR30","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0103003","volume":"3","author":"DW Peaceman","year":"1955","unstructured":"Peaceman DW, Rachford HH (1955) The numerical solution of parabolic and elliptic differential equations. J Soc Ind Appl Math 3(1):28\u201341","journal-title":"J Soc Ind Appl Math"},{"issue":"1\u20134","key":"949_CR31","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin LI, Osher S, Fatemi E (1992) Nonlinear total variation based noise removal algorithms. Physica D 60(1\u20134):259\u2013268","journal-title":"Physica D"},{"issue":"1","key":"949_CR32","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1137\/110854989","volume":"6","author":"H Schaeffer","year":"2013","unstructured":"Schaeffer H, Osher S (2013) A low patch-rank interpretation of texture. SIAM J Imaging Sci 6(1):226\u2013262","journal-title":"SIAM J Imaging Sci"},{"issue":"1","key":"949_CR33","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1186\/s13660-017-1447-3","volume":"2017","author":"H Sun","year":"2017","unstructured":"Sun H, Tian M, Sun M (2017) The symmetric ADMM with indefinite proximal regularization and its application. J Inequal Appl 2017(1):172","journal-title":"J Inequal Appl"},{"issue":"1","key":"949_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/100781894","volume":"21","author":"M Tao","year":"2011","unstructured":"Tao M, Yuan X (2011) Recovering low-rank and sparse components of matrices from incomplete and noisy observations. SIAM J Optim 21(1):57\u201381","journal-title":"SIAM J Optim"},{"issue":"3","key":"949_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-018-9992-3","volume":"70","author":"M Tao","year":"2018","unstructured":"Tao M, Yuan X (2018) The generalized proximal point algorithm with step size 2 is not necessarily convergent. Comput Optim Appl 70(3):1\u201313","journal-title":"Comput Optim Appl"},{"issue":"3","key":"949_CR36","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1111\/j.1467-9868.2011.00771.x","volume":"73","author":"R Tibshirani","year":"2011","unstructured":"Tibshirani R (2011) Regression shrinkage and selection via the lasso: a retrospective. J R Stat Soc Ser B Stat Methodol 73(3):273\u2013282","journal-title":"J R Stat Soc Ser B Stat Methodol"},{"key":"949_CR37","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.cam.2016.02.001","volume":"309","author":"J Wang","year":"2017","unstructured":"Wang J, Song W (2017) An algorithm twisted from generalized ADMM for multi-block separable convex minimization models. J Comput Appl Math 309:342\u2013358","journal-title":"J Comput Appl Math"},{"issue":"4","key":"949_CR38","first-page":"1","volume":"96","author":"Z Wu","year":"2018","unstructured":"Wu Z, Liu F, Li M (2018) A proximal Peaceman\u2013Rachford splitting method for solving the multi-block separable convex minimization problems. Int J Comput Math 96(4):1\u201326","journal-title":"Int J Comput Math"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0949-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-019-0949-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-019-0949-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:23:57Z","timestamp":1602026637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-019-0949-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,8]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["949"],"URL":"https:\/\/doi.org\/10.1007\/s40314-019-0949-7","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,8]]},"assertion":[{"value":"26 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"180"}}