{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T09:11:00Z","timestamp":1730279460036,"version":"3.28.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/ivmspw.2018.8448807","type":"proceedings-article","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T16:04:31Z","timestamp":1536336271000},"page":"1-5","source":"Crossref","is-referenced-by-count":2,"title":["Improved Solution to the $\\ell_{0}$ Regularized Optimization Problem via Dictionary-Reduced Initial Guess"],"prefix":"10.1109","author":[{"given":"Paul","family":"Rodriguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Simulations for ell0 regularized optimization","year":"0","author":"rodriguez","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0376-0"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0449"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/151003714"},{"key":"ref35","article-title":"Fast convolutional sparse coding with $\\ell_{0}$ penalty","author":"rodr?guez","year":"0","journal-title":"2018 submitted IEEE International Conference on Electrical Electronics and Computers"},{"key":"ref34","article-title":"Separable dictionary learning for convolutional sparse coding via split updates","author":"quesada","year":"2018","journal-title":"IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9035-z"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref12","article-title":"On the Suboptimality of Proximal Gradient Descent for $\\ell_{0}$ Sparse Approximation","author":"yang","year":"2017","journal-title":"ArXiv e-prints"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.01.003"},{"key":"ref14","article-title":"Expanded Alternating Optimization of Nonconvex Functions with Applications to Matrix Factorization and Penalized Regression","author":"murdoch","year":"2014","journal-title":"ArXiv e-prints"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/3-540-45631-7_39","article-title":"Some notes on alternating optimization","volume":"2275","author":"bezdek","year":"2002","journal-title":"Advances in Soft Computing – AFSS 2002 ser Lecture Notes in Computer Science"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref17","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":"Soviet Mathematics Doklady"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.57"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539958"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/83.784433"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042413"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007606"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1080\/00207178908953472"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.2307\/1269730"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2160633"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.5802\/aif.1638"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0484-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2015.2430359"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/060670080"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539957"},{"key":"ref22","first-page":"6701","article-title":"LO-based sparse approximation: two alternative methods and some applications","volume":"6701","author":"portilla","year":"2007","journal-title":"Proc SPIE"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792240406"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"ref23","first-page":"1474","article-title":"Bayesian pursuit algorithms","author":"herzet","year":"2010","journal-title":"18th European Signal Processing Conference 2010"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(99)00074-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2421476"}],"event":{"name":"2018 IEEE 13th Image, Video, and Multidimensional Signal Processing Workshop (IVMSP)","start":{"date-parts":[[2018,6,10]]},"location":"Zagorochoria","end":{"date-parts":[[2018,6,12]]}},"container-title":["2018 IEEE 13th Image, Video, and Multidimensional Signal Processing Workshop (IVMSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8424856\/8448402\/08448807.pdf?arnumber=8448807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T07:29:57Z","timestamp":1643182197000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8448807\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/ivmspw.2018.8448807","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}