{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:19:53Z","timestamp":1740169193507,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Chung-Ang University Research Grants, in 2019"},{"name":"Institute of Information & Communications Technology Planning & Evaluation"},{"DOI":"10.13039\/501100003621","name":"Korea government (MSIT)","doi-asserted-by":"publisher","award":["2019-0-01371"],"award-info":[{"award-number":["2019-0-01371"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3009971","type":"journal-article","created":{"date-parts":[[2020,7,17]],"date-time":"2020-07-17T20:26:01Z","timestamp":1595017561000},"page":"132489-132501","source":"Crossref","is-referenced-by-count":0,"title":["Nonconvex Sparse Representation With Slowly Vanishing Gradient Regularizers"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0840-0044","authenticated-orcid":false,"given":"Eunwoo","family":"Kim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4941-4311","authenticated-orcid":false,"given":"Minsik","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9781-2018","authenticated-orcid":false,"given":"Songhwai","family":"Oh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"801","article-title":"Efficient sparse coding algorithms","author":"lee","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.118"},{"key":"ref33","first-page":"379","article-title":"Accelerated proximal gradient methods for nonconvex programming","author":"li","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1975-0367131-6"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2981740"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2883566"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2012.700713"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206547"},{"key":"ref35","first-page":"559","article-title":"Regularized M-estimators with nonconvexity: Statistical and algorithmic theory for local optima","volume":"16","author":"loh","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref34","article-title":"Global convergence of ADMM in nonconvex nonsmooth optimization","author":"wang","year":"2015","journal-title":"arXiv 1511 06324"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007606"},{"key":"ref40","first-page":"663","article-title":"Robust subspace segmentation by low-rank representation","author":"liu","year":"2010","journal-title":"Proc ICML"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042413"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS729"},{"key":"ref13","first-page":"37","article-title":"A general iterative shrinkage and thresholding algorithm for non-convex regularized optimization problems","author":"gong","year":"2013","journal-title":"Proc ICML"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/TNNLS.2014.2312535","article-title":"Efficient $l_{1}$\n-norm-based low-rank matrix approximations for large-scale problems using alternating rectified gradient method","volume":"26","author":"kim","year":"2015","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"ref15","first-page":"1","article-title":"Nonconvex sparse spectral clustering by alternating direction method of multipliers and its convergence analysis","author":"lu","year":"2018","journal-title":"Proc 32nd AAAI Conf Artif Intell"},{"key":"ref16","first-page":"1","article-title":"Learning sparse neural networks through $l_{0}$\n regularization","author":"louizos","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.526"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2007.911828"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2011.tm09738"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.79"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.1993.342465"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-018-0002-6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2010.2050625"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1198\/016214501753382273"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.1993.10485033"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2044470"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9045-x"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.881199"},{"key":"ref46","article-title":"Linearized alternating direction method with adaptive penalty for low rank representation","author":"lin","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref20","first-page":"1","article-title":"Weighted low-rank approximations","author":"srebro","year":"2003","journal-title":"Proc ICML"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2007.382974"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298693"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2013.309"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref24","first-page":"1457","article-title":"Sparse prediction with the k-support norm","author":"argyriou","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","first-page":"2487","article-title":"Greedy feature selection for subspace clustering","volume":"14","author":"dyer","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2588321"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2005.92"},{"key":"ref26","first-page":"1929","article-title":"Multi-stage convex relaxation for learning with sparse regularization","author":"zhang","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref43","first-page":"1555","article-title":"Learning non-rigid 3D shape from 2D motion","author":"torresani","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/83.392335"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09143086.pdf?arnumber=9143086","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:54:31Z","timestamp":1639770871000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9143086\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":46,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3009971","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}