{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T12:23:29Z","timestamp":1785414209985,"version":"3.56.0"},"reference-count":107,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Mag."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1109\/msp.2015.2481563","type":"journal-article","created":{"date-parts":[[2015,12,25]],"date-time":"2015-12-25T19:03:45Z","timestamp":1451070225000},"page":"57-77","source":"Crossref","is-referenced-by-count":408,"title":["A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data: With applications in machine learning and signal processing"],"prefix":"10.1109","volume":"33","author":[{"given":"Mingyi","family":"Hong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meisam","family":"Razaviyayn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jong-Shi","family":"Pang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0800-2"},{"key":"ref38","author":"razaviyayn","year":"2014","journal-title":"Successive Convex Approximation Analysis and Applications"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205801"},{"key":"ref32","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"0","journal-title":"Proc Neural Information Processing Systems (NIPS)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1162\/08997660360581958"},{"key":"ref30","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 R Stat Soc Series B"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584660"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017501703105"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2489640"},{"key":"ref34","article-title":"Signal processing and optimal resource allocation for the interference channel","author":"hong","year":"2013","journal-title":"Academic Press Library in Signal Processing"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0035-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"ref20","author":"razaviyayn","year":"2013","journal-title":"A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks"},{"key":"ref22","first-page":"783","article-title":"Optimization with first-order surrogate functions","author":"mairal","year":"0","journal-title":"Proc Int Conf Machine Learning (ICML)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref101","author":"pang","year":"2014","journal-title":"A unified distributed algorithm for non-cooperative games with non-convex and non-differentiable objectives"},{"key":"ref26","author":"sun","year":"2014","journal-title":"Guaranteed matrix completion via nonconvex factorization"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2293126"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref50","author":"bertsekas","year":"1999","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00074-7"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2335237"},{"key":"ref58","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/JSTSP.2007.914876","article-title":"Dynamic spectrum management: Complexity and duality","volume":"2","author":"luo","year":"2008","journal-title":"IEEE J Sel Top Signal Processing"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20303"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/NECO_a_00168","article-title":"Algorithms for nonnegative matrix factorization with the beta-divergence","volume":"23","author":"f\u00e9votte","year":"2011","journal-title":"Neural Comput"},{"key":"ref55","author":"li","year":"2012","journal-title":"On the convergence of Lee-Seung's multiplicative update for NMF"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553463"},{"key":"ref53","author":"lu","year":"2013","journal-title":"Randomized block coordinate non-monotone gradient method for a class of nonlinear programming"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/120887679"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2251"},{"key":"ref3","author":"sra","year":"2012","journal-title":"Optimization for Machine Learning"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329397"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0614-z"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1198\/0003130042836"},{"key":"ref7","author":"aybat","year":"2014","journal-title":"First order methods for large-scale sparse optimization"},{"key":"ref9","author":"cui","year":"2015","journal-title":"Big Data Over Networks"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-014-0047-x"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/130949993"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/141000270"},{"key":"ref42","author":"hong","year":"2013","journal-title":"Iteration Complexity Analysis of Block Coordinate Descent Methods"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/13094829X"},{"key":"ref44","author":"hong","year":"2013","journal-title":"A Block Successive Upper Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/110840054"},{"key":"ref73","first-page":"1","article-title":"Foundations of the parafac procedure: Models and conditions for an “explanatory” multimodal factor analysis","volume":"16","author":"harshman","year":"1970","journal-title":"UCLA Working Papers in Phonetics"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1002\/nla.297"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref74","first-page":"1","article-title":"Swamp reducing technique for tensor decomposition","author":"navasca","year":"0","journal-title":"Proc 16th European Signal Processing Conf (EUSIPCO)"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2278516"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854604"},{"key":"ref79","first-page":"801","article-title":"Efficient sparse coding algorithms","author":"lee","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2284753"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.130211"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/T-WC.2008.070851"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797605"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2120270"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.101206"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2009-10-3-r25"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"ref68","author":"bray","year":"2015","journal-title":"Near-optimal RNA-Seq quantification"},{"key":"ref2","article-title":"Special Issue on Signal Processing for Big Data","volume":"31","year":"2014","journal-title":"IEEE Signal Processing Mag"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102451"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2000000048"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178500"},{"key":"ref94","first-page":"2454","article-title":"An asynchronous distributed proximal method for composite convex optimization","author":"aybat","year":"0","journal-title":"Proc 32th Int Conf Machine Learning (ICML)"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2014.6958862"},{"key":"ref93","author":"reddi","year":"2014","journal-title":"Large-scale randomized-coordinate descent methods with non-separable linear constraints"},{"key":"ref106","first-page":"28","article-title":"Feature clustering for accelerating parallel coordinate descent","author":"scherrer","year":"0","journal-title":"Proc Advanced in Neural Information Processing Systems (NIPS)"},{"key":"ref92","article-title":"A random coordinate descent method on large-scale optimization problems with linear constraints","author":"necoara","year":"2011","journal-title":"Tech Rep"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2013.6810364"},{"key":"ref91","author":"ames","year":"0","journal-title":"Alternating directions method of multipliers for l1-penalized zero variance discriminant analysis and principal component analysis"},{"key":"ref104","author":"richt\u00e1rik","year":"2013","journal-title":"Distributed Coordinate Descent Method for Learning with Big Data"},{"key":"ref90","author":"hong","year":"0","journal-title":"Convergence analysis of alternating direction method of multipliers for a family of nonconvex problems"},{"key":"ref103","first-page":"1440","article-title":"Parallel successive convex approximation for nonsmooth nonconvex optimization","author":"razaviyayn","year":"0","journal-title":"Proc Advances in Neural Information Processing Systems (NIPS)"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1287\/opre.26.4.681"},{"key":"ref99","author":"facchinei","year":"2013","journal-title":"Flexible parallel algorithms for big data optimization"},{"key":"ref96","year":"2013","journal-title":"Gurobi Optimizer Reference Manual"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1137\/0325067"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/83.491316"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v033.i01"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2147784"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/110834524"},{"key":"ref14","first-page":"1632","article-title":"Coordinate descent converges faster with the Gauss-Southwell rule than random selection","author":"nutini","year":"0","journal-title":"Proc Int Conf Machine Learn (ICML)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0901-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854999"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2011.00783.x"},{"key":"ref17","article-title":"An asynchronous parallel stochastic coordinate descent algorithm","author":"liu","year":"0","journal-title":"Proc Int Conf Machine Learning (ICML)"},{"key":"ref81","volume":"544","author":"mclachlan","year":"2004","journal-title":"Discriminant Analysis and Statistical Pattern Recognition"},{"key":"ref18","first-page":"1440","article-title":"Parallel successive convex approximation for nonsmooth nonconvex optimization","author":"razaviyayn","year":"0","journal-title":"Proc Neural Inf Process (NIPS)"},{"key":"ref84","first-page":"2283","article-title":"Stochastic majorization-minimization algorithms for large-scale optimization","author":"mairal","year":"2013","journal-title":"Proc Advances in Neural Information Processing Systems"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2399858"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4939-1384-8_8"},{"key":"ref80","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"aharon","year":"2006","journal-title":"IEEE Trans Signal Processing"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-12613-4"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2013.6612065"},{"key":"ref86","first-page":"19","article-title":"Online learning for matrix factorization and sparse coding","volume":"11","author":"mairal","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2345536"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"}],"container-title":["IEEE Signal Processing Magazine"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/79\/7366379\/7366709.pdf?arnumber=7366709","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,13]],"date-time":"2024-06-13T11:22:17Z","timestamp":1718277737000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7366709\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":107,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/msp.2015.2481563","relation":{},"ISSN":["1053-5888"],"issn-type":[{"value":"1053-5888","type":"print"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}