{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:36:20Z","timestamp":1730230580543,"version":"3.28.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,23]]},"DOI":"10.1109\/icassp43922.2022.9747190","type":"proceedings-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T19:50:34Z","timestamp":1651089034000},"page":"5538-5542","source":"Crossref","is-referenced-by-count":2,"title":["Graph-Structured Sparse Regularization Via Convex Optimization"],"prefix":"10.1109","author":[{"given":"Hiroki","family":"Kuroda","sequence":"first","affiliation":[{"name":"Ritsumeikan University,College of Information Science and Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daichi","family":"Kitahara","sequence":"additional","affiliation":[{"name":"Ritsumeikan University,College of Information Science and Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmaa.2016.12.021"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-017-0407-x"},{"article-title":"Proximal splitting algorithms for convex optimization: A tour of recent advances, with new twists","year":"2021","author":"condat","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-2012-02598-1"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0946-6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1214\/19-EJS1662"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1080\/23249935.2015.1087229"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2014.960926"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2020754"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2044837"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2105478"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2196694"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00532.x"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/08-EJS200"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3150\/10-BEJ252"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS392"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/29\/2\/025011"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2019.2904965"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/12\/125007"},{"key":"ref3","first-page":"7563","article-title":"Stochastic iterative hard thresholding for graph-structured sparsity optimization","volume":"97","author":"zhou","year":"2019","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0082"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6420\/33\/4\/044003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2813311"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00137"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.13"},{"key":"ref2","first-page":"1389","article-title":"A generalized matching pursuit approach for graph-structured sparsity","author":"chen","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell (IJCAI)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)CP.1943-5487.0000079"},{"key":"ref1","first-page":"928","article-title":"A nearly-linear time framework for graph-structured sparsity","author":"hegde","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref20","first-page":"2777","article-title":"Structured variable selection with sparsity-inducing norms","volume":"12","author":"jenatton","year":"2011","journal-title":"J Mach Learn Res"},{"article-title":"Block-sparse recovery with optimal block partition","year":"2021","author":"kuroda","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553431"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414340"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/09076934X"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10851-010-0251-1"}],"event":{"name":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2022,5,23]]},"location":"Singapore, Singapore","end":{"date-parts":[[2022,5,27]]}},"container-title":["ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9745891\/9746004\/09747190.pdf?arnumber=9747190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T20:13:11Z","timestamp":1661199191000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9747190\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/icassp43922.2022.9747190","relation":{},"subject":[],"published":{"date-parts":[[2022,5,23]]}}}