{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:00:51Z","timestamp":1770991251948,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,7]],"date-time":"2018-11-07T00:00:00Z","timestamp":1541548800000},"content-version":"tdm","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":["11701564"],"award-info":[{"award-number":["11701564"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11075-018-0618-8","type":"journal-article","created":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T22:27:10Z","timestamp":1541543230000},"page":"641-662","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A prediction\u2013correction-based primal\u2013dual hybrid gradient method for linearly constrained convex minimization"],"prefix":"10.1007","volume":"82","author":[{"given":"Feng","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiming","family":"Bi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9976-1859","authenticated-orcid":false,"given":"Bin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,7]]},"reference":[{"key":"618_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1561\/2400000003","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1, 127\u2013239 (2014)","journal-title":"Found. Trends Optim."},{"key":"618_CR2","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/s10851-011-0324-9","volume":"44","author":"S Bonettini","year":"2012","unstructured":"Bonettini, S., Ruggiero, V.: On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration. J. Math. Imaging Vision 44, 236\u2013253 (2012)","journal-title":"J. Math. Imaging Vision"},{"key":"618_CR3","doi-asserted-by":"publisher","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"JF Cai","year":"2010","unstructured":"Cai, J.F., Cand\u00e8s, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"618_CR4","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1007\/s10898-012-9999-8","volume":"57","author":"XJ Cai","year":"2013","unstructured":"Cai, X.J., Han, D.R., Xu, L.L.: An improved first-order primal-dual algorithm with a new correction step. J. Glob. Optim. 57, 1419\u20131428 (2013)","journal-title":"J. Glob. Optim."},{"key":"618_CR5","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Recht, B.: Exact matrix completion via convex optimization. Found Comput. Math. 9, 717\u2013772 (2009)","journal-title":"Found Comput. Math."},{"key":"618_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithms for convex problem with applications to imaging. J. Math. Imaging Vis. 40, 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"618_CR7","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10107-015-0957-3","volume":"159","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: On the ergodic convergence rates of a first-order primaldual algorithm. Math. Prog., Series A 159, 253\u2013287 (2016)","journal-title":"Math. Prog., Series A"},{"key":"618_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S096249291600009X","volume":"25","author":"A Chambolle","year":"2016","unstructured":"Chambolle, A., Pock, T.: An introduction to continuous optimization for imaging. Acta Numerica 25, 161\u2013319 (2016)","journal-title":"Acta Numerica"},{"key":"618_CR9","doi-asserted-by":"crossref","unstructured":"Chan, R.H., Ma, S.Q., Yang, J.F.: Inertial primal-dual algorithms for structured convex optimization. arXiv:\n                    1409.2992\n                    \n                   (2014)","DOI":"10.1155\/2014\/396753"},{"key":"618_CR10","doi-asserted-by":"publisher","first-page":"1779","DOI":"10.1137\/130919362","volume":"24","author":"Y Chen","year":"2014","unstructured":"Chen, Y., Lan, G., Ouyang, Y.: Optimal primal-dual methods for a class of saddle point problems. SIAM J. Optim. 24, 1779\u20131814 (2014)","journal-title":"SIAM J. Optim."},{"key":"618_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43, 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"key":"618_CR12","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1137\/09076934X","volume":"3","author":"E Esser","year":"2010","unstructured":"Esser, E., Zhang, X.Q., Chan, T.F.: A general framework for a class of first order primal-dual algorithms for convex optimization in imaging science. SIAM J. Imag. Sci. 3, 1015\u20131046 (2010)","journal-title":"SIAM J. Imag. Sci."},{"key":"618_CR13","unstructured":"Goldstein, T., Li, M., Yuan, X.: Adaptive Primal-Dual Splitting Methods for Statistical Learning and Image Processing. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems 28, pp. 2089\u20132097. Curran Associates, Inc. \n                    http:\/\/papers.nips.cc\/paper\/5723-adaptive-primal-dual-splitting-methods-for-statistical-learningand-image-processing.pdf\n                    \n                   (2015)"},{"key":"618_CR14","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10851-017-0709-5","volume":"58","author":"BS He","year":"2017","unstructured":"He, B.S., Ma, F., Yuan, X.M.: An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems. J. Math. Imaging Vis. 58, 279\u2013293 (2017)","journal-title":"J. Math. Imaging Vis."},{"key":"618_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/100814494","volume":"5","author":"BS He","year":"2012","unstructured":"He, B.S., Yuan, X.M.: Convergence analysis of primal-dual algorithms for a saddle-point problem: From contraction perspective. SIAM J. Imaging Sci. 5, 119\u2013149 (2012)","journal-title":"SIAM J. Imaging Sci."},{"key":"618_CR16","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10589-013-9564-5","volume":"56","author":"BS He","year":"2013","unstructured":"He, B.S., Yuan, X.M., Zhang, W.X.: A customized proximal point algorithm for convex minimization with linear constraints. Comput. Optim Appl. 56, 559\u2013572 (2013)","journal-title":"Comput. Optim Appl."},{"key":"618_CR17","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1137\/140963467","volume":"7","author":"BS He","year":"2014","unstructured":"He, B.S., You, Y.F., Yuan, X.M.: On the convergence of primal-dual hybrid gradient algorithm. SIAM J. Imaging Sci. 7, 2526\u20132537 (2014)","journal-title":"SIAM J. Imaging Sci."},{"key":"618_CR18","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s10898-016-0437-1","volume":"66","author":"HJ He","year":"2016","unstructured":"He, H.J., Desai, J., Wang, K.: A primal-dual prediction-correction algorithm for saddle point optimization. J. Glob. Optim. 66, 573\u2013583 (2016)","journal-title":"J. Glob. Optim."},{"key":"618_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF00927673","volume":"4","author":"MR Hestenes","year":"1969","unstructured":"Hestenes, M.R.: Multiplier and gradient methods. J. Optim. Theory Appli. 4, 303\u2013320 (1969)","journal-title":"J. Optim. Theory Appli."},{"key":"618_CR20","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1051\/m2an\/197004R301541","volume":"126","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: Regularision d\u2019in\u00e9quations variationnelles par approximations successive. Revue Francaise d\u2019Automatique et Informatique Recherche Op\u00e9rationnelle 126, 154\u2013159 (1970)","journal-title":"Revue Francaise d\u2019Automatique et Informatique Recherche Op\u00e9rationnelle"},{"key":"618_CR21","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1007\/s40314-016-0371-3","volume":"37","author":"F Ma","year":"2018","unstructured":"Ma, F., Ni, M.F.: A class of customized proximal point algorithms for linearly constrained convex optimization. Comput. Appl. Math. 37, 896\u2013911 (2018)","journal-title":"Comput. Appl. Math."},{"key":"618_CR22","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"SQ Ma","year":"2011","unstructured":"Ma, S.Q., Goldfarb, D., Chen, L.: Fixed point and Bregman iterative methods for matrix rank minimization. Math. Prog. Ser. A. 128, 321\u2013353 (2011)","journal-title":"Math. Prog. Ser. A."},{"key":"618_CR23","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"LI Rudin","year":"1992","unstructured":"Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60, 259\u2013268 (1992)","journal-title":"Phys. D"},{"key":"618_CR24","unstructured":"Powell, M.J.D.: A Method for Nonlinear Constraints in Minimization Problems. In: Fletcher, R. (ed.) Optimization, pp 283\u2013298. Academic Press, New York (1969)"},{"key":"618_CR25","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone operators and the proximal point algorithm,. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"618_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511730344","volume-title":"Sparse image and signal processing, wavelets, curvelets, morphological diversity","author":"JL Starck","year":"2010","unstructured":"Starck, J.L., Murtagh, F., Fadili, J.M.: Sparse image and signal processing, wavelets, curvelets, morphological diversity. Cambridge University Press, Cambridge (2010)"},{"key":"618_CR27","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"JF Yang","year":"2013","unstructured":"Yang, J.F., Yuan, X.M.: Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization. Math. Comp. 82, 301\u2013329 (2013)","journal-title":"Math. Comp."},{"key":"618_CR28","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10915-010-9408-8","volume":"46","author":"XQ Zhang","year":"2010","unstructured":"Zhang, X.Q., Burger, M., Osher, S.: A unified primal-dual algorithm framework based on Bregman iteration. J. Sci. Comput. 46, 20\u201346 (2010)","journal-title":"J. Sci. Comput."},{"key":"618_CR29","unstructured":"Zhu, M., Chan, T.F.: An efficient primal-dual hybrid gradient algorithm for total variation image restoration, CAM Report 08-34, UCLA USA (2008)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-018-0618-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-018-0618-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T19:20:15Z","timestamp":1573068015000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-018-0618-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,7]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["618"],"URL":"https:\/\/doi.org\/10.1007\/s11075-018-0618-8","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,7]]},"assertion":[{"value":"23 November 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}