{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T02:15:06Z","timestamp":1790648106648,"version":"4.1.0"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"18","license":[{"start":{"date-parts":[[2017,9,15]],"date-time":"2017-09-15T00:00:00Z","timestamp":1505433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"CNRS Imag\u2019in Project","award":["2015 OPTIMISME"],"award-info":[{"award-number":["2015 OPTIMISME"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2017,9,15]]},"DOI":"10.1109\/tsp.2017.2709265","type":"journal-article","created":{"date-parts":[[2017,5,29]],"date-time":"2017-05-29T18:08:13Z","timestamp":1496081293000},"page":"4770-4783","source":"Crossref","is-referenced-by-count":40,"title":["A Stochastic Majorize-Minimize Subspace Algorithm for Online Penalized Least Squares Estimation"],"prefix":"10.1109","volume":"65","author":[{"given":"Emilie","family":"Chouzenoux","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Christophe","family":"Pesquet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref73","first-page":"233","article-title":"A convergence theorem for non negative almost supermartingales and some applications","author":"robbins","year":"1971","journal-title":"Proc Optimizing Methods in Statistics"},{"key":"ref72","first-page":"1","article-title":"Martingales in sequential analysis and time series, 1945&#x2013;1985","volume":"5","author":"lai","year":"2009","journal-title":"Electron J History Probab Statist"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177696721"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1093\/0198774036.001.0001"},{"key":"ref74","author":"ostrowski","year":"1973","journal-title":"Solution of Equations in Euclidean and Banach Spaces"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936023"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5022-x"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2048103"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2264464"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2090874"},{"key":"ref30","first-page":"1","article-title":"Regularized least-mean-square algorithms","author":"chen","year":"2010"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1198\/0003130042836"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638822"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2338839"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2046897"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/BF00929359"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2013.6738209"},{"key":"ref61","first-page":"1139","article-title":"On the importance of initialization and momentum in deep learning","volume":"28","author":"sutskever","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1995.479482"},{"key":"ref28","first-page":"1","article-title":"Sparsity-aware affine projection adaptive algorithms for system identification","author":"meng","year":"2011","journal-title":"Proc Sens Signal Process Def"},{"key":"ref64","author":"manolakis","year":"2005","journal-title":"Statistical and Adaptive Signal Processing"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495870"},{"key":"ref65","volume":"35","author":"kushner","year":"2003","journal-title":"Stochastic Approximation and Recursive Algorithms and Applications"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v17-1952"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1155\/2007\/34242"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v18-2586"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016.2593589"},{"key":"ref69","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 Neural Inf Proc Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/11085997X"},{"key":"ref1","first-page":"1","article-title":"A stochastic 3MG algorithm with application to 2D filter identification","author":"chouzenoux","year":"0","journal-title":"Proc 22nd Eur Signal Process Conf"},{"key":"ref20","first-page":"451","article-title":"Non-asymptotic analysis of stochastic approximation algorithms for machine learning","author":"bach","year":"2011","journal-title":"Proc Ann Conf Neural Inf Process Syst"},{"key":"ref22","author":"macchi","year":"1995","journal-title":"Adaptive Processing The Least Mean Squares Approach with Applications in Transmission"},{"key":"ref21","author":"widrow","year":"1985","journal-title":"Adaptive Signal Processing"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2006.354982"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326788"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02559-4","author":"paleologu","year":"2010","journal-title":"Sparse Adaptive Filters for Echo Cancellation"},{"key":"ref25","first-page":"3125","article-title":"Sparse LMS for system identification","author":"chen","year":"2009","journal-title":"Proc Int Conf Acoust Speech Signal Process"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2005.864173"},{"key":"ref59","first-page":"372","article-title":"A method of solving a convex programming problem with convergence rate $o(1\/k^2)$","volume":"27","author":"nesterov","year":"1983","journal-title":"Sov Math Dokl"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.909319"},{"key":"ref56","first-page":"1534","article-title":"SEBOOST&#x2014;Boosting stochastic learning using subspace optimization techniques","author":"richardson","year":"2016","journal-title":"Proc Ann Conf Neural Inf Proc Syst"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/83.931094"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/050639132"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/83.551699"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/030600862"},{"key":"ref10","author":"haykin","year":"2002","journal-title":"Adaptive Filter Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2103083"},{"key":"ref12","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) Akad Nauk Ukrain SSR"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497331063"},{"key":"ref14","article-title":"On stochastic proximal gradient algorithms","author":"atchad\u00e9","year":"2014","journal-title":"Tech Rep"},{"key":"ref15","article-title":"Convergence of stochastic proximal gradient algorithm","author":"rosasco","year":"2014","journal-title":"Tech Rep"},{"key":"ref16","first-page":"13","article-title":"Stochastic approximations and perturbations in forward-backward splitting for monotone operators","volume":"1","author":"combettes","year":"2016","journal-title":"Pure Appl Funct Anal"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1109\/JSTSP.2015.2505682","article-title":"Mini-batch semi-stochastic gradient descent in the proximal setting","volume":"10","author":"kone?n\u00fd","year":"2016","journal-title":"IEEE J Sel Topics Signal Process"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref4","author":"theodoridis","year":"2015","journal-title":"Machine Learning A Bayesian and Optimization Perspective"},{"key":"ref3","first-page":"146","article-title":"Stochastic learning","author":"bottou","year":"2004","journal-title":"Advanced Lectures on Machine Learning"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2006.07.001"},{"key":"ref5","first-page":"3201","article-title":"GURLS: A least squares library for supervised learning","volume":"14","author":"tacchetti","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/047134608X.W8294"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2496908"},{"key":"ref49","article-title":"Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms","author":"gower","year":"2016","journal-title":"Tech Rep"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-4106-9","author":"diniz","year":"2013","journal-title":"Adaptive Filtering Algorithms and Practical Implementation"},{"key":"ref46","first-page":"1737","article-title":"SGD-QN: Careful quasi-Newton stochastic gradient descent","volume":"10","author":"bordes","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref45","article-title":"A stochastic Newton method for stochastic quadratic programs with recourse","author":"birge","year":"1995","journal-title":"Tech Rep"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/140954362"},{"key":"ref47","first-page":"1145","article-title":"A quasi-Newton approach to nonsmooth convex optimization problems in machine learning","volume":"11","author":"yu","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref42","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":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2013.09.026"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2505684"},{"key":"ref43","first-page":"5","article-title":"Stochastic majorization-minimization algorithms for large-scale optimization","author":"mairal","year":"0","journal-title":"Proc Adv Conf Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7973135\/07935412.pdf?arnumber=7935412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:56:21Z","timestamp":1750280181000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7935412\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,15]]},"references-count":74,"journal-issue":{"issue":"18"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2017.2709265","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,15]]}}}