{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T21:44:38Z","timestamp":1776635078646,"version":"3.51.2"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Sectoral Operational Programme Human Resources Development","award":["POSDRU\/159\/1.5\/S\/134398"],"award-info":[{"award-number":["POSDRU\/159\/1.5\/S\/134398"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/tac.2015.2390551","type":"journal-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T20:59:44Z","timestamp":1421096384000},"page":"1811-1824","source":"Crossref","is-referenced-by-count":17,"title":["Random Coordinate Descent Methods for <inline-formula> <tex-math notation=\"TeX\">$\\ell_{0}$<\/tex-math><\/inline-formula> Regularized Convex Optimization"],"prefix":"10.1109","volume":"60","author":[{"given":"Andrei","family":"Patrascu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ion","family":"Necoara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2011.6160383"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717107"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2012.2219629"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2011.2163807"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2257618"},{"key":"ref13","first-page":"1","article-title":"Iterative Hard Thresholding Methods for $l_{0}$ Regularized Convex Cone Programming","author":"lu","year":"2012","journal-title":"Mathematical Programming"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/5.824004"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/0805030"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2294622"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426647"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2013.2250071"},{"key":"ref19","article-title":"A random coordinate descent method on large optimization problems with linear constraints","author":"necoara","year":"0","journal-title":"Int Conf Continuous Optim (ICCOPT)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0614-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0151-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/120869778"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"ref29","first-page":"233","article-title":"A convergence theorem for nonnegative almost upermartingales and some applications","author":"robbins","year":"1971","journal-title":"Optimizing Methods in Statics"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref8","author":"hong","year":"2013","journal-title":"Iteration Complexity Analysis of Block Coordinate Descent Methods"},{"key":"ref7","first-page":"121","article-title":"Phasor state estimation from PMU measurements with bad data","author":"duan","year":"0","journal-title":"Proc IEEE Workshop Computat Adv Multi-Sensor Adaptive Processes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.01.036"},{"key":"ref9","first-page":"517","article-title":"Generalized power method for sparse principal component analysis","volume":"11","author":"journee","year":"2010","journal-title":"J Mach Learning Res"},{"key":"ref1","first-page":"807","article-title":"Greedy sparsity-constrained optimization","volume":"14","author":"bahmani","year":"2013","journal-title":"J Mach Learning Res"},{"key":"ref20","author":"necoara","year":"2013","journal-title":"Parallel random coordinate descent methods for composite minimization"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9598-8"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2010.03.013"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/11085476X"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.09.021"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2166295"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/7132652\/07006764.pdf?arnumber=7006764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:47:24Z","timestamp":1642006044000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7006764\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":31,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tac.2015.2390551","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7]]}}}