{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T17:37:54Z","timestamp":1785605874292,"version":"3.56.0"},"reference-count":161,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode"},{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/3.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","award":["2015OPTIMISME"],"award-info":[{"award-number":["2015OPTIMISME"]}],"id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF- 1018368"],"award-info":[{"award-number":["CCF- 1018368"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1218754"],"award-info":[{"award-number":["CCF-1218754"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR- 11-IDEX-0002-02"],"award-info":[{"award-number":["ANR- 11-IDEX-0002-02"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-L ABX-0040-CIMI"],"award-info":[{"award-number":["ANR-11-L ABX-0040-CIMI"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-12- BS03-003"],"award-info":[{"award-number":["ANR-12- BS03-003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-13- BS-03-0006-01"],"award-info":[{"award-number":["ANR-13- BS-03-0006-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["FP7-PEOPLE-2013-IEF \/ 624502"],"award-info":[{"award-number":["FP7-PEOPLE-2013-IEF \/ 624502"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/D063485\/1"],"award-info":[{"award-number":["EP\/D063485\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/J015180\/1"],"award-info":[{"award-number":["EP\/J015180\/1"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-15-1-0479"],"award-info":[{"award-number":["W911NF-15-1-0479"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/jstsp.2015.2496908","type":"journal-article","created":{"date-parts":[[2015,11,2]],"date-time":"2015-11-02T20:46:54Z","timestamp":1446497214000},"page":"224-241","source":"Crossref","is-referenced-by-count":107,"title":["A Survey of Stochastic Simulation and Optimization Methods in Signal Processing"],"prefix":"10.1109","volume":"10","author":[{"given":"Marcelo","family":"Pereyra","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip","family":"Schniter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emilie","family":"Chouzenoux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Christophe","family":"Pesquet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Yves","family":"Tourneret","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfred O.","family":"Hero","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Steve","family":"McLaughlin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2014.930041"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190066"},{"key":"ref33","author":"betancourt","year":"2014","journal-title":"Optimizing the Integrator Step Size for Hamiltonian Monte Carlo"},{"key":"ref32","first-page":"1593","article-title":"The no-u-turn sampler: Adaptively setting path lengths in Hamiltonian Monte Carlo","volume":"15","author":"hoffman","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref31","first-page":"2393","article-title":"Quasi-Newton methods for Markov chain Monte Carlo","author":"zhang","year":"2011","journal-title":"Adv Neural Inf Process Syst (NIPS) 24"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ414"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1198\/jcgs.2009.08108"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1198\/016214508000000409"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-99"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP806"},{"key":"ref28","first-page":"113","author":"neal","year":"2013","journal-title":"Handbook of Markov Chain Monte Carlo"},{"key":"ref27","author":"schreck","year":"2013","journal-title":"?A shrinkage-thresholding metropolis adjusted Langevin algorithm for Bayesian variable selection"},{"key":"ref29","article-title":"The geometric foundations of Hamiltonian Monte Carlo","author":"betancourt","year":"2014","journal-title":"ArXiv e-prints"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2010.00765.x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-006-8550-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40020-9_35"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-015-9567-4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/11-AAP828"},{"key":"ref101","first-page":"781","article-title":"Accelerated gradient methods for stochastic optimization and online learning","author":"hu","year":"2009","journal-title":"Proc Ann Conf Neur Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s11009-010-9196-5"},{"key":"ref100","author":"xu","year":"2014","journal-title":"?Block stochastic gradient iteration for convex and nonconvex optimization ?"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.spl.2014.04.002"},{"key":"ref50","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref154","first-page":"2897","article-title":"Fonctions convexes duales et points proximaux dans un espace Hilbertien","volume":"255","author":"moreau","year":"1962","journal-title":"C R Acad Sci Paris S\ufffdr II"},{"key":"ref153","first-page":"1332","article-title":"Majorize-minimize adapted Metropolis Hastings algorithm. Application to multichannel image recovery","author":"marnissi","year":"2014","journal-title":"Proc Eur Signal Process Conf (EUSIPCO?14)"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1111\/1467-9868.00288"},{"key":"ref155","article-title":"A Hamiltonian Monte Carlo method for non-smooth energy sampling","author":"chaari","year":"2014","journal-title":"ArXiv e-prints"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2013.6760448"},{"key":"ref152","article-title":"Convergent stochastic expectation maximization algorithm with efficient sampling in high dimension. Application to deformable template model estimation","author":"allassonniere","year":"2012","journal-title":"ArXiv e-prints"},{"key":"ref151","author":"bianchi","year":"2014","journal-title":"?A Stochastic Coordinate Descent Primal-Dual Algorithm and Applications to Large-Scale Composite Optimization ?"},{"key":"ref146","first-page":"567","article-title":"Stochastic dual coordinate ascent methods for regularized loss minimization","volume":"14","author":"shalev-shwartz","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref147","article-title":"Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization","author":"shalev-shwartz","year":"2014","journal-title":"Math Program Ser A"},{"key":"ref148","first-page":"3068","article-title":"Communication-efficient distributed dual coordinate ascent","author":"jaggi","year":"2014","journal-title":"Proc Annu Conf Neur Inf Process Syst"},{"key":"ref149","author":"qu","year":"2014","journal-title":"?Randomized dual coordinate ascent with arbitrary sampling ?"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.1013125"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026501619075"},{"key":"ref56","author":"mackay","year":"2003","journal-title":"Information Theory Inference and Learning Algorithms"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/49.661103"},{"key":"ref54","first-page":"467","article-title":"Loopy belief propagation for approximate inference: An empirical study","author":"murphy","year":"1999","journal-title":"Proc Uncert Artif Intell"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90060-D"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1023\/A:1007665907178"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367457"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2189104"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4145-2","author":"robert","year":"2004","journal-title":"Monte Carlo Statistical Methods"},{"key":"ref3","first-page":"209","article-title":"A variational Bayesian framework for graphical models","author":"attias","year":"2000","journal-title":"Proc Neural Inf Process Syst Conf"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1093\/oxfordhb\/9780199571888.013.0010","author":"doucet","year":"2011","journal-title":"The Oxford Handbook of Nonlinear Filtering"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-015-9574-5"},{"key":"ref159","first-page":"1858","article-title":"Gaussian sampling by local perturbations","author":"papandreou","year":"2010","journal-title":"Adv Neural Inf Process Syst 23"},{"key":"ref8","first-page":"1","article-title":"Approximate Bayesian computational methods","author":"marin","year":"2011","journal-title":"Statist Comput"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-015-9556-7"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1137\/0112045"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1109\/83.392335"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"ref46","article-title":"Graphical models, exponential families, and variational inference","volume":"1","author":"wainwright","year":"2008","journal-title":"Found Trends Mach Learn"},{"key":"ref45","author":"parisi","year":"1988","journal-title":"Statistical Field Theory"},{"key":"ref48","first-page":"1033","article-title":"The concave-convex procedure (CCCP)","volume":"2","author":"yuille","year":"2002","journal-title":"Proc Neural Inf Process Syst Conf"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850085"},{"key":"ref42","author":"weinstock","year":"1974","journal-title":"Calculus of Variations"},{"key":"ref41","author":"bishop","year":"2007","journal-title":"Pattern Recognition and Machine Learning"},{"key":"ref44","first-page":"995","article-title":"A mean field theory learning algorithm for neural networks","volume":"1","author":"peterson","year":"1987","journal-title":"Complex Syst"},{"key":"ref43","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1109\/EUSIPCO.2015.7362380"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1137\/140957639"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2264464"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2090874"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6874830"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2337841"},{"key":"ref129","author":"bertsekas","year":"2010","journal-title":"?Incremental gradient subgradient and proximal methods for convex optimization A survey ?"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875083"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1137\/040615961"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620309"},{"key":"ref76","first-page":"x","article-title":"Large scale online learning","author":"bottou","year":"2004","journal-title":"Proc Annu Conf Neur Inf Process Syst"},{"key":"ref130","author":"schmidt","year":"2013","journal-title":"?Minimizing finite sums with the stochastic average gradient ?"},{"key":"ref77","year":"2011","journal-title":"Optimization for Machine Learning"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178325"},{"key":"ref75","author":"rangan","year":"2015","journal-title":"?Inference for feneralized linear models via alternating directions and Bethe free energy minimization ?"},{"key":"ref133","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Annu Conf Neur Inf Process Syst"},{"key":"ref134","author":"kone?n\ufffd","year":"2014","journal-title":"?mS2GD Mini-batch semi-stochastic gradient descent in the proximal setting ?"},{"key":"ref131","first-page":"1125","article-title":"Finito: A faster, permutable incremental gradient method for big data problems","author":"defazio","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref78","author":"theodoridis","year":"2015","journal-title":"Machine Learning A Bayesian and Optimization Perspective"},{"key":"ref132","first-page":"1646","article-title":"SAGA: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"2014","journal-title":"Proc Ann Conf Neur Inf Proc Syst"},{"key":"ref79","author":"haykin","year":"2002","journal-title":"Adaptive Filter Theory"},{"key":"ref136","author":"chouzenoux","year":"2014","journal-title":"?A block coordinate variable metric forward-backward algorithm ?"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2377273"},{"key":"ref137","article-title":"A class of randomized primal-dual algorithms for distributed optimization","author":"pesquet","year":"2015","journal-title":"J Nonlinear Convex Anal"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0614-z"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2005\/11\/P11015"},{"key":"ref61","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref63","first-page":"353","article-title":"Approximate expectation maximization","author":"heskes","year":"2004","journal-title":"Proc Neural Inf Process Syst Conf"},{"key":"ref64","author":"minka","year":"2001","journal-title":"A family of algorithms for approximate Bayesian inference"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9598-8"},{"key":"ref65","author":"seeger","year":"2005","journal-title":"?Expectation propagation for exponential families ?"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0800-2"},{"key":"ref66","first-page":"1001","article-title":"Expectation consistent free energies for approximate inference","author":"opper","year":"2005","journal-title":"Proc Neural Inf Process Syst Conf"},{"key":"ref142","author":"fercoq","year":"2014","journal-title":"?Accelerated parallel and proximal coordinate Descent ?"},{"key":"ref67","first-page":"313","article-title":"Expectation propagation for approximate inference in dynamic Bayesian networks","author":"heskes","year":"2002","journal-title":"Proc Uncert Artif Intell"},{"key":"ref143","author":"qu","year":"2014","journal-title":"?Coordinate descent with arbitrary sampling I Algorithms and complexity ?"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5014-9_12"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iat004"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-010-0147-7"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum-likelihood from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1995.479482"},{"key":"ref95","first-page":"14","article-title":"Composite objective mirror descent","author":"duchi","year":"2010","journal-title":"Proc Conf Learn Theory"},{"key":"ref108","author":"kushner","year":"2003","journal-title":"Stochastic Approximation and Recursive Algorithms and Applications"},{"key":"ref94","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"xiao","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref107","author":"widrow","year":"1985","journal-title":"Adaptive Signal Processing"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273598"},{"key":"ref106","first-page":"1587","article-title":"A stochastic 3MG algorithm with application to 2D filter identification","author":"chouzenoux","year":"2014","journal-title":"Proc 22nd Eur Signal Process Conf"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017746"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref104","first-page":"2121","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"duchi","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref90","first-page":"451","article-title":"Non-asymptotic analysis of stochastic approximation algorithms for machine learning","author":"bach","year":"2011","journal-title":"Proc Ann Conf Neur Inf Proc Syst"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9633-9"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"},{"key":"ref111","article-title":"An improved proportionate NLMS algorithm based on the <formula formulatype=\"inline\"><tex Notation=\"TeX\">$l_{0}$<\/tex><\/formula> norm","author":"paleologu","year":"2010","journal-title":"Proc Int Conf Acoust Speech Signal Process"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326788"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2006.354982"},{"key":"ref98","first-page":"392","article-title":"Dual averaging and proximal gradient descent for online alternating direction multiplier method","author":"suzuki","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref99","author":"zhong","year":"2014","journal-title":"?Fast stochastic alternating direction method of multipliers ? Tech Rep"},{"key":"ref96","first-page":"1086","article-title":"Accelerated stochastic gradient method for composite regularization","volume":"33","author":"zhong","year":"2014","journal-title":"Journal of Machine Learning Rechearch"},{"key":"ref97","first-page":"80","article-title":"Stochastic alternating direction method of multipliers","author":"ouyang","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/57.1.97"},{"key":"ref11","first-page":"327","article-title":"Understanding the Metropolis-Hastings algorithm","volume":"49","author":"chib","year":"1995","journal-title":"Ann Math Statist"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/105051607000000096"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1015346320"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOS574"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1111\/j.1467-9868.2009.00736.x","article-title":"Particle Markov chain Monte Carlo (with discussion)","volume":"72","author":"andrieu","year":"2011","journal-title":"J Roy Statist Soc Ser B"},{"key":"ref118","doi-asserted-by":"crossref","first-page":"4557","DOI":"10.1109\/TSP.2014.2334560","article-title":"Sparsity-aware data-selective adaptive filters","volume":"62","author":"markus","year":"2014","journal-title":"IEEE Trans Signal Process"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2013.2249076"},{"key":"ref82","first-page":"2899","article-title":"Efficient online and batch learning using forward backward splitting","volume":"10","author":"duchi","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref117","first-page":"5666","article-title":"Affine projection algorithms for sparse system identification","author":"markus","year":"2013","journal-title":"Proc Int Conf Acoust Speech Signal Process"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-4149(99)00082-4"},{"key":"ref81","first-page":"185","author":"combettes","year":"2010","journal-title":"Fixed-Point Algorithms For Inverse Problems in Science and Engineering"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1214\/08-AAP563"},{"key":"ref84","author":"rosasco","year":"2014","journal-title":"?A stochastic forward-backward splitting method for solving monotone inclusions in Hilbert spaces ?"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495870"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2307\/3318418"},{"key":"ref83","author":"atchad\ufffd","year":"2014","journal-title":"?On stochastic proximal gradient algorithms ?"},{"key":"ref114","first-page":"3125","article-title":"Sparse LMS for system identification","author":"chen","year":"2009","journal-title":"Proc Int Conf Acoust Speech Signal Process"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2012.6287844"},{"key":"ref116","first-page":"1","article-title":"Sparsity-aware affine projection adaptive algorithms for system identification","author":"meng","year":"2011","journal-title":"Proc Sensor Signal Process Defence"},{"key":"ref80","author":"sayed","year":"2011","journal-title":"Adaptive Filters"},{"key":"ref115","author":"chen","year":"2010","journal-title":"?Regularized least-mean-square algorithms ?"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947303"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497331063"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638822"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2046897"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2048103"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1137\/140971233"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref87","first-page":"24","article-title":"The method of stochastic gradients and its application","author":"ermoliev","year":"1967","journal-title":"Seminar Theory of Optimal Solutions No 1 (Russian)"},{"key":"ref88","first-page":"143","article-title":"The rate of convergence of the method of generalized stochastic gradients","author":"guseva","year":"1971","journal-title":"Kibernetika (Kiev)"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/4200690\/7406776\/7314898-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/7406776\/07314898.pdf?arnumber=7314898","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T05:24:06Z","timestamp":1718169846000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7314898\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":161,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2015.2496908","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}