{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,6]],"date-time":"2026-08-06T18:13:34Z","timestamp":1786040014335,"version":"3.56.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,5,31]],"date-time":"2015-05-31T00:00:00Z","timestamp":1433030400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s11222-015-9567-4","type":"journal-article","created":{"date-parts":[[2015,5,30]],"date-time":"2015-05-30T06:11:13Z","timestamp":1432966273000},"page":"745-760","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":97,"title":["Proximal Markov chain Monte Carlo algorithms"],"prefix":"10.1007","volume":"26","author":[{"given":"Marcelo","family":"Pereyra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,5,31]]},"reference":[{"issue":"3","key":"9567_CR1","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1109\/TIP.2010.2076294","volume":"20","author":"M Afonso","year":"2011","unstructured":"Afonso, M., Bioucas-Dias, J., Figueiredo, M.: An augmented Lagrangian approach to the constrained optimization formulation of imaging inverse problems. IEEE. Trans. Image Process. 20(3), 681\u2013695 (2011)","journal-title":"IEEE. Trans. Image Process."},{"issue":"5","key":"9567_CR2","doi-asserted-by":"crossref","first-page":"2452","DOI":"10.1214\/12-AOS1032","volume":"40","author":"A Agarwal","year":"2012","unstructured":"Agarwal, A., Negahban, S., Wainwright, J.M.: Fast global convergence of gradient methods for high-dimensional statistical recovery. Ann. Stat. 40(5), 2452\u20132482 (2012)","journal-title":"Ann. Stat."},{"issue":"2","key":"9567_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s11009-006-8550-0","volume":"8","author":"Y Atchade","year":"2006","unstructured":"Atchade, Y.: An adaptive version for the Metropolis adjusted Langevin algorithm with a truncated drift. Methodol. Comput. Appl. Probab. 8(2), 235\u2013254 (2006)","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"9567_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces. Springer, New York (2011)"},{"issue":"1","key":"9567_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/090756855","volume":"4","author":"S Becker","year":"2009","unstructured":"Becker, S., Bobin, J., Cand\u00e8s, E.J.: NESTA: a fast and accurate first-order method for sparse recovery. SIAM J. Imaging Sci. 4(1), 1\u201339 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"9567_CR6","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E.J., Plan, Y.: Matrix completion with noise. Proc. IEEE 98, 925\u2013936 (2009)","DOI":"10.1109\/JPROC.2009.2035722"},{"issue":"5","key":"9567_CR7","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"EJ Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E.J., Tao, T.: The power of convex relaxation: near-optimal matrix completion. IEEE Trans. Inf. Theory 56(5), 2053\u20132080 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9567_CR8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/MSP.2007.914731","volume":"25","author":"EJ Cand\u00e8s","year":"2008","unstructured":"Cand\u00e8s, E.J., Wakin, M.B.: An introduction to compressive sampling. IEEE Signal Process. Mag. 25(2), 21\u201330 (2008)","journal-title":"IEEE Signal Process. Mag."},{"key":"9567_CR9","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E. J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58(3), 11:1\u201311:37 (2011)","DOI":"10.1145\/1970392.1970395"},{"issue":"19","key":"9567_CR10","doi-asserted-by":"crossref","first-page":"4643","DOI":"10.1109\/TSP.2013.2270464","volume":"61","author":"EJ Cand\u00e8s","year":"2013","unstructured":"Cand\u00e8s, E.J., Sing-Long, C.A., Trzasko, J.D.: Unbiased risk estimates for singular value thresholding and spectral estimators. IEEE Trans. Signal Process. 61(19), 4643\u20134657 (2013)","journal-title":"IEEE Trans. Signal Process."},{"issue":"4","key":"9567_CR11","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1007\/s11009-010-9196-5","volume":"13","author":"B Casella","year":"2011","unstructured":"Casella, B., Roberts, G., Stramer, O.: Stability of partially implicit Langevin schemes and their MCMC variants. Methodol. Comput. Appl. Probab. 13(4), 835\u2013854 (2011)","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"9567_CR12","unstructured":"Chaari, L., Batatia, H., Chaux, C. & Tourneret, J.-Y.: Sparse signal and image recovery using a proximal Bayesian algorithm. ArXiv e-prints (2014)"},{"issue":"1\u20132","key":"9567_CR13","first-page":"89","volume":"20","author":"A Chambolle","year":"2004","unstructured":"Chambolle, A.: An algorithm for total variation minimization and applications. J. Math. Imaging Vis. 20(1\u20132), 89\u201397 (2004)","journal-title":"J. Math. Imaging Vis."},{"issue":"13","key":"9567_CR14","doi-asserted-by":"crossref","first-page":"1181","DOI":"10.1073\/pnas.1302293110","volume":"110","author":"V Chandrasekaran","year":"2013","unstructured":"Chandrasekaran, V., Jordan, M.I.: Computational and statistical tradeoffs via convex relaxation. Proc. Natl Acad. Sci. U.S.A. 110(13), 1181\u20131190 (2013)","journal-title":"Proc. Natl Acad. Sci. U.S.A."},{"issue":"2","key":"9567_CR15","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1137\/090761793","volume":"21","author":"V Chandrasekaran","year":"2011","unstructured":"Chandrasekaran, V., Sanghavi, S., Parrilo, P., Willsky, A.: Rank-sparsity incoherence for matrix decomposition. SIAM J. Optim. 21(2), 572\u2013596 (2011)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"9567_CR16","doi-asserted-by":"crossref","first-page":"1935","DOI":"10.1214\/11-AOS949","volume":"40","author":"V Chandrasekaran","year":"2012","unstructured":"Chandrasekaran, V., Parrilo, P.A., Willsky, A.S.: Latent variable graphical model selection via convex optimization. Ann. Stat. 40(4), 1935\u20131967 (2012)","journal-title":"Ann. Stat."},{"issue":"4","key":"9567_CR17","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"P Combettes","year":"2005","unstructured":"Combettes, P., Wajs, V.: Signal recovery by proximal forward-backward splitting. Multiscale Model. Simul. 4(4), 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"9567_CR18","first-page":"181","volume-title":"Fixed-Point Algorithms for Inverse Problems in Science and Engineering","author":"PL Combettes","year":"2011","unstructured":"Combettes, P.L., Pesquet, J.-C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R.S., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 181\u2013212. Springer, New York (2011)"},{"key":"9567_CR19","unstructured":"Fazel, M.: Matrix rank minimization with applications. PhD thesis, Department of Electrical Engineering, Stanford University (2002)"},{"key":"9567_CR20","doi-asserted-by":"crossref","DOI":"10.1201\/b16018","volume-title":"Bayesian Data Analysis","author":"A Gelman","year":"2013","unstructured":"Gelman, A., Carlin, J.B., Stern, H.S., Dunson, D.B., Vehtari, A., Rubin, D.B.: Bayesian Data Analysis, 3rd edn. Chapman and Hall\/CRC, London (2013)","edition":"3"},{"issue":"4","key":"9567_CR21","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1214\/ss\/1177011137","volume":"7","author":"CJ Geyer","year":"1992","unstructured":"Geyer, C.J.: Practical Markov chain Monte Carlo. Stat. Sci. 7(4), 473\u2013483 (1992)","journal-title":"Stat. Sci."},{"issue":"2","key":"9567_CR22","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1111\/j.1467-9868.2010.00765.x","volume":"73","author":"M Girolami","year":"2011","unstructured":"Girolami, M., Calderhead, B.: Riemann manifold Langevin and Hamiltonian Monte Carlo methods. J. R. Stat. Soc. Ser. B 73(2), 123\u2013214 (2011)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"9567_CR23","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718874","volume-title":"Deblurring Images: Matrices, Spectra, and Filtering","author":"PC Hansen","year":"2006","unstructured":"Hansen, P.C., Nagy, J.G., O\u2019Leary, D.P.: Deblurring Images: Matrices, Spectra, and Filtering. SIAM, Philadelphia (2006)"},{"issue":"3","key":"9567_CR24","doi-asserted-by":"crossref","first-page":"1041","DOI":"10.1137\/S0036142901389530","volume":"40","author":"DJ Higham","year":"2003","unstructured":"Higham, D.J., Mao, X., Stuart, A.M.: Strong convergence of Euler-type methods for nonlinear stochastic differential equations. SIAM J. Numer. Anal. 40(3), 1041\u20131063 (2003)","journal-title":"SIAM J. Numer. Anal."},{"key":"9567_CR25","doi-asserted-by":"crossref","unstructured":"Komodakis, N., Pesquet, J.-C.: Playing with duality: an overview of recent primal-dual approaches for solving large-scale optimization problems. ArXiv e-prints (2014)","DOI":"10.1109\/MSP.2014.2377273"},{"issue":"2","key":"9567_CR26","first-page":"188","volume":"73","author":"K \u0141atuszy\u0144ski","year":"2011","unstructured":"\u0141atuszy\u0144ski, K., Roberts, G.O., Thi\u00e9ry, A., Wolny, K.: Discussion of Riemann manifold Langevin and Hamiltonian Monte Carlo methods by Mark Girolami and Ben Calderhead. J. R. Stat. Soc. Ser. B 73(2), 188\u2013189 (2011)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"9567_CR27","unstructured":"Marnissi, Y., Benazza-Benyahia, A., Chouzenoux, E., Pesquet, J.-C.: Majorize-Minimize adapted Metropolis-Hastings algorithm. Application to multichannel image recovery. In: 22th European Signal Processing Conference (EUSIPCO 2014), Lisbon, Portugal (2014)"},{"key":"9567_CR28","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: Regularisation d\u2019in\u00e9quations variationelles par approximations successives. Revue Fran. d\u2019Automatique et Infomatique Rech. Op\u00e9rationelle 4, 154\u2013159 (1970)","journal-title":"Revue Fran. d\u2019Automatique et Infomatique Rech. Op\u00e9rationelle"},{"issue":"2","key":"9567_CR29","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0304-4149(02)00150-3","volume":"101","author":"J Mattingly","year":"2002","unstructured":"Mattingly, J., Stuart, A., Higham, D.: Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise. Stoch. Proc. Appl. 101(2), 185\u2013232 (2002)","journal-title":"Stoch. Proc. Appl."},{"key":"9567_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-3267-7","volume-title":"Markov Chains and Stochastic Stability","author":"S Meyn","year":"1993","unstructured":"Meyn, S., Tweedie, R.: Markov Chains and Stochastic Stability. Springer, London (1993)"},{"key":"9567_CR31","first-page":"2897","volume":"255","author":"J-J Moreau","year":"1962","unstructured":"Moreau, J.-J.: Fonctions convexes duales et points proximaux dans un espace Hilbertien. C. R. Acad. Sci. Paris S\u00e9r. A Math. 255, 2897\u20132899 (1962)","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. A Math."},{"key":"9567_CR32","doi-asserted-by":"crossref","unstructured":"Neal, R.: MCMC using Hamiltonian dynamics. ArXiv e-prints (2012)","DOI":"10.1201\/b10905-6"},{"key":"9567_CR33","first-page":"1665","volume":"13","author":"S Negahban","year":"2012","unstructured":"Negahban, S., Wainwright, M.J.: Restricted strong convexity and weighted matrix completion: optimal bounds with noise. J. Mach. Learn. Res. 13, 1665\u20131697 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"9567_CR34","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1016\/j.sigpro.2009.03.018","volume":"89","author":"J Oliveira","year":"2009","unstructured":"Oliveira, J., Bioucas-Dias, J., Figueiredo, M.: Adaptive total variation image deblurring: a majorization-minimization approach. Signal Process. 89(9), 1683\u20131693 (2009)","journal-title":"Signal Process."},{"key":"9567_CR35","unstructured":"Ottobre, M., Stuart, A.M.: Diffusion limit for the random walk Metropolis algorithm out of stationarity. ArXiv e-prints (2014)"},{"key":"9567_CR36","doi-asserted-by":"crossref","unstructured":"Papadopoulo, T., Lourakis, M. I. A.: Estimating the Jacobian of the singular value decomposition: theory and applications. In: Proceedings of the 6th European Conference on Computer Vision-Part I (ECCV \u201900), pp. 554\u2013570 (2000)","DOI":"10.1007\/3-540-45054-8_36"},{"issue":"3","key":"9567_CR37","first-page":"123","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2014)","journal-title":"Found. Trends Optim."},{"issue":"482","key":"9567_CR38","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1198\/016214508000000337","volume":"103","author":"T Park","year":"2008","unstructured":"Park, T., Casella, G.: The Bayesian lasso. J. Am. Stat. Assoc. 103(482), 681\u2013686 (2008)","journal-title":"J. Am. Stat. Assoc."},{"key":"9567_CR39","unstructured":"Pereyra, M.: Proximal Markov chain Monte Carlo algorithms. ArXiv e-prints (2013)"},{"issue":"2","key":"9567_CR40","first-page":"273","volume":"8","author":"J-C Pesquet","year":"2012","unstructured":"Pesquet, J.-C., Pustelnik, N.: A parallel inertial proximal optimization method. Pac. J. Optim. 8(2), 273\u2013305 (2012)","journal-title":"Pac. J. Optim."},{"issue":"6","key":"9567_CR41","doi-asserted-by":"crossref","first-page":"2320","DOI":"10.1214\/11-AAP828","volume":"22","author":"NS Pillai","year":"2012","unstructured":"Pillai, N.S., Stuart, A.M., Thiry, A.H.: Optimal scaling and diffusion limits for the Langevin algorithm in high dimensions. Ann. Appl. Probab. 22(6), 2320\u20132356 (2012)","journal-title":"Ann. Appl. Probab."},{"key":"9567_CR42","first-page":"2287","volume":"11","author":"M Rahul","year":"2010","unstructured":"Rahul, M., Trevor, H., Robert, T.: Spectral regularization algorithms for learning large incomplete matrices. J. Mach. Learn. Res. 11, 2287\u20132322 (2010)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"9567_CR43","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"9567_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4145-2","volume-title":"Monte Carlo Statistical Methods","author":"CP Robert","year":"2004","unstructured":"Robert, C.P., Casella, G.: Monte Carlo Statistical Methods, 2nd edn. Springer, New York (2004)","edition":"2"},{"key":"9567_CR45","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1023\/A:1023562417138","volume":"4","author":"G Roberts","year":"2002","unstructured":"Roberts, G., Stramer, O.: Langevin diffusions and Metropolis\u2013Hastings algorithms. Methodol. Comput. Appl. Probab. 4, 337\u2013357 (2002)","journal-title":"Methodol. Comput. Appl. Probab."},{"issue":"4","key":"9567_CR46","doi-asserted-by":"crossref","first-page":"341","DOI":"10.2307\/3318418","volume":"2","author":"GO Roberts","year":"1996","unstructured":"Roberts, G.O., Tweedie, R.L.: Exponential convergence of Langevin distributions and their discrete approximations. Bernulli 2(4), 341\u2013363 (1996)","journal-title":"Bernulli"},{"key":"9567_CR47","doi-asserted-by":"crossref","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":"9567_CR48","unstructured":"Schreck, A., Fort, G., Le Corff, S., Moulines, E.: A shrinkage-thresholding Metropolis adjusted Langevin algorithm for Bayesian variable selection. ArXiv e-prints (2013)"},{"key":"9567_CR49","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1010086427957","volume":"1","author":"O Stramer","year":"1999","unstructured":"Stramer, O., Tweedie, R.L.: Langevin-type models I: diffusions with given stationary distributions and their discretizations. Methodol. Comput. Appl. Probab. 1, 283\u2013306 (1999a)","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"9567_CR50","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1010090512027","volume":"1","author":"O Stramer","year":"1999","unstructured":"Stramer, O., Tweedie, R.L.: Langevin-type models II: self-targeting candidates for MCMC algorithms. Methodol. Comput. Appl. Probab. 1, 307\u2013328 (1999b)","journal-title":"Methodol. Comput. Appl. Probab."},{"key":"9567_CR51","unstructured":"Yuan, Q., Minka, T. P.: Hessian-based Markov chain Monte Carlo Algorithms. Unpublished manuscript (2002)"},{"key":"9567_CR52","unstructured":"Zhang, Y., Sutton, C.: Quasi-Newton Markov chain Monte Carlo. In: Advances in Neural Information Processing Systems (NIPS) (2011)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11222-015-9567-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9567-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-015-9567-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,2]],"date-time":"2020-09-02T21:48:51Z","timestamp":1599083331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11222-015-9567-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,31]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["9567"],"URL":"https:\/\/doi.org\/10.1007\/s11222-015-9567-4","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"value":"0960-3174","type":"print"},{"value":"1573-1375","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,31]]}}}